Suffix Tree of Alignment: An Efficient Index for Similar Data

DOI10.1007/978-3-642-45278-9_29zbMath1407.68115arXiv1305.1744OpenAlexW1552221124MaRDI QIDQ2870039

Heejin Park, Jan Holub, Maxime Crochemore, Costas S. Iliopoulos, Laurent Mouchard, Joong Chae Na, Kun Soo Park

Publication date: 17 January 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.1744

zbMATH Keywords

suffix treesalignmentsindexes for similar data

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Related Items (8)

On-line string matching in highly similar DNA sequences ⋮ FM-index of alignment: a compressed index for similar strings ⋮ Document listing on repetitive collections with guaranteed performance ⋮ Grammar-compressed indexes with logarithmic search time ⋮ Algorithms and complexity on indexing founder graphs ⋮ FM-index of alignment with gaps ⋮ Algorithms for Indexing Highly Similar DNA Sequences ⋮ Faster Compressed Suffix Trees for Repetitive Collections

This page was built for publication: Suffix Tree of Alignment: An Efficient Index for Similar Data