Suffix arrays in Data Structures Theory - Mini Project: Build & Apply

Building a Simple Suffix Array

📖 Scenario: Imagine you have a word and you want to organize all its endings (suffixes) in alphabetical order. This helps in searching and analyzing text efficiently.

🎯 Goal: You will build a simple suffix array for a given word. A suffix array is a list of all suffixes of the word sorted alphabetically, represented by their starting positions.

📋 What You'll Learn

Create a list of all suffixes of the word with their starting indexes

Create a helper variable to hold the length of the word

Sort the suffixes alphabetically using their text

Create the final suffix array as a list of starting indexes of sorted suffixes

💡 Why This Matters

🌍 Real World

Suffix arrays are used in text search engines, DNA sequence analysis, and data compression to quickly find patterns in large texts.

💼 Career

Understanding suffix arrays is useful for software engineers working in search technologies, bioinformatics, and data processing.

1

Create the list of suffixes

Create a variable called word and set it to the string "banana". Then create a list called suffixes that contains tuples of the form (index, suffix_text) for every suffix of word. The index is the starting position of the suffix in word, and suffix_text is the substring from that index to the end.

Data Structures Theory

word = "banana"
# Your code here

Hint

Use a list comprehension with range(len(word)) to get all suffixes.

2

Create a helper variable for word length

Create a variable called n and set it to the length of word using the len() function.

Data Structures Theory

word = "banana"
suffixes = [(i, word[i:]) for i in range(len(word))]
n = len(word)
# Your code here

Hint

Use len(word) to get the length.

3

Sort the suffixes alphabetically

Sort the list suffixes alphabetically by the suffix text (the second item in each tuple) using the sort() method with a key argument.

Data Structures Theory

word = "banana"
suffixes = [(i, word[i:]) for i in range(len(word))]
n = len(word)
suffixes.sort(key=lambda x: x[1])
# Your code here

Hint

Use suffixes.sort(key=lambda x: x[1]) to sort by suffix text.

4

Create the suffix array of starting indexes

Create a list called suffix_array that contains only the starting indexes from the sorted suffixes list.

Data Structures Theory

word = "banana"
suffixes = [(i, word[i:]) for i in range(len(word))]
n = len(word)
suffixes.sort(key=lambda x: x[1])
suffix_array = [i for i, s in suffixes]
# Your code here

Hint

Use a list comprehension to extract the first item of each tuple in suffixes.

Practice

1. What is a suffix array in the context of text processing?

easy

A. A data structure that stores the frequency of each character

B. An array listing all suffixes of a text sorted alphabetically

C. An array listing all prefixes of a text sorted by length

D. A list of all words in a text sorted by their length

Solution

1. Step 1: Understand suffix array definition

   A suffix array is a list of all suffixes (endings) of a text sorted alphabetically.

2. Step 2: Compare options with definition

   Only An array listing all suffixes of a text sorted alphabetically correctly describes this; others describe different concepts.

3. Final Answer:

   An array listing all suffixes of a text sorted alphabetically -> Option B

4. Quick Check:

   Suffix array = sorted suffixes list [OK]

Hint: Suffix arrays always sort text endings alphabetically [OK]

Common Mistakes:

• Confusing suffix array with prefix array
• Thinking it stores character frequencies
• Assuming it sorts words, not suffixes

2. Which of the following is the correct way to represent the suffix array of the string banana?

easy

A. [5, 3, 1, 0, 4, 2]

B. [0, 1, 2, 3, 4, 5]

C. [1, 3, 5, 0, 2, 4]

D. [5, 4, 3, 2, 1, 0]

Solution

1. Step 1: List all suffixes of 'banana' with their start indices

   Suffixes: 0:'banana', 1:'anana', 2:'nana', 3:'ana', 4:'na', 5:'a'

2. Step 2: Sort suffixes alphabetically and note indices

   Sorted suffixes: 'a'(5), 'ana'(3), 'anana'(1), 'banana'(0), 'na'(4), 'nana'(2)

3. Final Answer:

   [5, 3, 1, 0, 4, 2] -> Option A

4. Quick Check:

   Sorted suffix indices = [5,3,1,0,4,2] [OK]

Hint: Sort suffixes alphabetically, then list their start positions [OK]

Common Mistakes:

• Sorting indices instead of suffix strings
• Confusing prefix indices with suffix indices
• Reversing the order of suffixes

3. Given the suffix array [3, 0, 4, 1, 5, 2] for a string, what is the likely original string if the suffixes sorted alphabetically are ['ana', 'banana', 'na', 'anana', 'a', 'nana']?

medium

A. panama

B. bandana

C. cabana

D. banana

Solution

1. Step 1: Match suffixes to indices

   Suffixes: 'ana'(3), 'banana'(0), 'na'(4), 'anana'(1), 'a'(5), 'nana'(2)

2. Step 2: Reconstruct string from suffixes and indices

   Suffix starting at 0 is 'banana', so original string is 'banana'

3. Final Answer:

   banana -> Option D

4. Quick Check:

   Suffix array matches 'banana' suffixes [OK]

Hint: Match suffix indices to strings to find original text [OK]

Common Mistakes:

• Assuming suffix array directly shows original string
• Mixing up suffix order with original string order
• Ignoring suffix start positions

4. Identify the error in the following suffix array construction code snippet for string "apple":

suffixes = [s[i:] for i in range(len(s))]
suffixes.sort()
suffix_array = [s.index(suf) for suf in suffixes]

medium

A. Using s.index() can return wrong indices if suffixes repeat

B. The suffixes list is not sorted correctly

C. Range should start from 1, not 0

D. The code misses converting suffixes to tuples before sorting

Solution

1. Step 1: Understand s.index() behavior

   s.index() returns the first occurrence index of substring, which can be wrong if suffix repeats.

2. Step 2: Identify impact on suffix array

   If suffixes repeat, s.index() returns same index multiple times, causing incorrect suffix array.

3. Final Answer:

   Using s.index() can return wrong indices if suffixes repeat -> Option A

4. Quick Check:

   Repeated suffixes break s.index() correctness [OK]

Hint: Avoid s.index() for suffix positions; use loop index instead [OK]

Common Mistakes:

• Assuming s.index() always gives correct suffix start
• Not sorting suffixes before indexing
• Starting range incorrectly

5. You want to find all occurrences of the pattern "ana" in the text "banana" using its suffix array [5, 3, 1, 0, 4, 2]. Which approach correctly uses the suffix array for this search?

hard

A. Sort the pattern 'ana' and compare with sorted suffixes

B. Scan the original text linearly and check each character for 'ana'

C. Perform a binary search on suffix array indices comparing suffixes with 'ana' to find matches

D. Use the suffix array to count characters in the text

Solution

1. Step 1: Understand suffix array usage for pattern search

   Suffix arrays allow binary search on sorted suffixes to quickly find pattern matches.

2. Step 2: Evaluate options

   Perform a binary search on suffix array indices comparing suffixes with 'ana' to find matches correctly describes binary search on suffix array; others do not use suffix array properly.

3. Final Answer:

   Perform a binary search on suffix array indices comparing suffixes with 'ana' to find matches -> Option C

4. Quick Check:

   Binary search on suffix array = efficient pattern search [OK]

Hint: Use binary search on suffix array for fast pattern matching [OK]

Common Mistakes:

• Linear scan ignoring suffix array benefits
• Sorting pattern instead of suffixes
• Using suffix array for unrelated tasks