Fast matching statistics in small space
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2087050
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- String matching with alphabet sampling
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- scientific article; zbMATH DE number 3954313
Cites work
- scientific article; zbMATH DE number 910859 (Why is no real title available?)
- A Compressed Enhanced Suffix Array Supporting Fast String Matching
- A simple optimal representation for balanced parentheses
- Compressed suffix trees with full functionality
- Fully functional static and dynamic succinct trees
- Fully-functional succinct trees
- Locally compressed suffix arrays
- Sequence similarity measures based on bounded Hamming distance
- Space-efficient parallel construction of succinct representations of suffix tree topologies
Cited in
(5)- scientific article; zbMATH DE number 7559178 (Why is no real title available?)
- Linear time construction of indexable founder block graphs
- scientific article; zbMATH DE number 2087050 (Why is no real title available?)
- Suffix sorting via matching statistics
- An efficient matching algorithm applied in statistical physics
This page was built for publication: Fast matching statistics in small space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140728)
