Compressed directed acyclic word graph with application in local alignment
From MaRDI portal
Publication:378207
DOI10.1007/s00453-013-9794-zzbMath1275.68063OpenAlexW2049350043MaRDI QIDQ378207
Publication date: 11 November 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-013-9794-z
Graph theory (including graph drawing) in computer science (68R10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)
Uses Software
Cites Work
- Unnamed Item
- Ultra-succinct representation of ordered trees with applications
- Average-case analysis of approximate trie search
- The smallest automaton recognizing the subwords of a text
- Compressed suffix trees with full functionality
- Suffix Arrays: A New Method for On-Line String Searches
- Indexing compressed text
- Rank/select operations on large alphabets
- Algorithms on Strings, Trees and Sequences
- SOFSEM 2005: Theory and Practice of Computer Science