Sorting suffixes : Let T be a string of characters ToT.T,-1, where T; denotes the i-th character (counting from 0) of T . A substring T..Tn-1,0

please use c program. thank youSorting suffixes :<br>Let T be a string of characters ToT.T,-1, where T; denotes the i-th character (counting from 0) of T .<br>A substring T..Tn-1,0 < i <n โ€“ 1, is called a suffix of T.<br>For example, for the string tgtgtgtgcaccg, its suffix starting at the 6th position is tgcaccg.<br>In fact, this string has 13 suffixes (because the length of the string is 13), and they are shown below along with their starting position in the string.<br>e:tgtgtgtgcaccg<br>1:gtgtgtgcaccg<br>2:tgtgtgcaccg<br>3:gtgtgcaccg<br>4:tgtgcaccg<br>5:gtgcaccg<br>6:tgcaccg<br>7:gcaccg<br>8:caccg<br>9:accg<br>10:ccg<br>11:cg<br>12:g<br>If we were to sort this set of suffixes in lexicographical order (the order you see in an English-language dictionary), we would get :<br>9:accg<br>8:caccg<br>10:ccg<br>11:cg<br>12:g<br>7:gcaccg<br>5:gtgcaccg<br>3:gtgtgcaccg<br>1:gtgtgtgcaccg<br>6:tgcaccg<br>4:tgtgcaccg<br>2:tgtgtgcaccg<br>0:tgtgtgtgcaccg<br>This list of sorted suffixes can be represented by an array containing just the starting positions (and not the suffixes themselves).<br>Such an array is called a suffix array.<br>For the example string above, its suffix array is:<br>98 10 11 12 75 3164 20<br>Choose one sorting algorithm from each of Groups 1 and 2 below. Brainstorm with your group members about how you would modify each of the 2 algorithms such that instead of<br>sorting numbers, it sorts all suffixes of a given string to produce the suffix array of the string.<br>Group 1: Insertion Sort<br>Group 2: Merge Sort<br>

Extracted text: Sorting suffixes : Let T be a string of characters ToT.T,-1, where T; denotes the i-th character (counting from 0) of T . A substring T..Tn-1,0 < i="">

Jun 09, 2022
SOLUTION.PDF

Get Answer To This Question

Related Questions & Answers

More Questions ยป

Submit New Assignment

Copy and Paste Your Assignment Here