Suffix array of alignment: A practical index for similar data

  • Na, Joong Chae
  • Park, Heejin
  • Lee, Sunho
  • Hong, Minsung
  • Lecroq, Thierry
  • 외 2명
Citations

SCOPUS

21

초록

The suffix tree of alignment is an index data structure for similar strings. Given an alignment of similar strings, it stores all suffixes of the alignment, called alignment-suffixes. An alignment-suffix represents one suffix of a string or suffixes of multiple strings starting at the same position in the alignment. The suffix tree of alignment makes good use of similarity in strings theoretically. However, suffix trees are not widely used in biological applications because of their huge space requirements, and instead suffix arrays are used in practice. In this paper we propose a space-economical version of the suffix tree of alignment, named the suffix array of alignment (SAA). Given an alignment ρ of similar strings, the SAA for ρ is a lexicographically sorted list of all the alignment-suffixes of ρ. The SAA supports pattern search as efficiently as the generalized suffix array. Our experiments show that our index uses only 14% of the space used by the generalized suffix array to index 11 human genome sequences. The space efficiency of our index increases as the number of the genome sequences increases. We also present an efficient algorithm for constructing the SAA.

키워드

AlignmentsIndexes for similar dataSuffix arraysAlgorithmsAlignmentForestryGenetic engineeringInformation retrievalBiological applicationsGenome sequencesIndex data structuresPattern searchSimilar datumSpace efficienciesSpace requirementsSuffix arraysIndexing (of information)AlgorithmsAlignmentForestryGenetic EngineeringIndexingInformation Retrieval
제목
Suffix array of alignment: A practical index for similar data
저자
Na, Joong ChaePark, HeejinLee, SunhoHong, MinsungLecroq, ThierryMouchard, LaurentPark, Kunsoo
DOI
10.1007/978-3-319-02432-5_27
발행일
2013-10
유형
Conference Paper
저널명
Lecture Notes in Computer Science
8214 LNCS
페이지
243 ~ 254