Compressed directed acyclic word graph with application in local alignment
DOI10.1007/S00453-013-9794-ZzbMATH Open1275.68063OpenAlexW2049350043MaRDI QIDQ378207FDOQ378207
Authors: Huy Hoang Do, Wing-Kin Sung 
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
Recommendations
- Compressed directed acyclic word graph with application in local alignment
- Compact directed acyclic word graphs for a sliding window
- Compact morphic directed acyclic word graphs
- On Sensitivity of Compact Directed Acyclic Word Graphs
- Locally compressed suffix arrays
- Dynamic dictionary matching and compressed suffix trees
- scientific article; zbMATH DE number 1786457
- On-line construction of compact directed acyclic word graphs
Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Algorithms on Strings, Trees and Sequences
- Indexing compressed text
- Ultra-succinct representation of ordered trees with applications
- Compressed suffix trees with full functionality
- Suffix Arrays: A New Method for On-Line String Searches
- The smallest automaton recognizing the subwords of a text
- Rank/select operations on large alphabets
- Title not available (Why is that?)
- SOFSEM 2005: Theory and Practice of Computer Science
- Average-case analysis of approximate trie search
Cited In (2)
Uses Software
This page was built for publication: Compressed directed acyclic word graph with application in local alignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q378207)
