Compressed directed acyclic word graph with application in local alignment
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- Algorithms on Strings, Trees and Sequences
- Average-case analysis of approximate trie search
- Compressed suffix trees with full functionality
- Indexing compressed text
- Rank/select operations on large alphabets
- SOFSEM 2005: Theory and Practice of Computer Science
- Suffix Arrays: A New Method for On-Line String Searches
- The smallest automaton recognizing the subwords of a text
- Ultra-succinct representation of ordered trees with applications
Cited in
(2)
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)