Indexing weighted sequences: neat and efficient
From MaRDI portal
Publication:2288210
DOI10.1016/j.ic.2019.104462zbMath1436.68082arXiv1704.07625OpenAlexW2972218931MaRDI QIDQ2288210
Jakub Radoszewski, Tomasz Kociumaka, Chang Liu, Carl Barton, Solon P. Pissis
Publication date: 17 January 2020
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.07625
Related Items
String covers of a tree, Property Suffix Array with Applications in Indexing Weighted Sequences, String Covering: A Survey, Experimental evaluation of algorithms for computing quasiperiods, Efficient Computation of 2-Covers of a String., Alignment-free sequence comparison using absent words, Streaming \(k\)-mismatch with error correcting and applications, Computing the Antiperiod(s) of a String
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The property suffix tree with dynamic properties
- Linear-time computation of prefix table for weighted strings {\&} applications
- Property matching and weighted matching
- Errata for ``Faster index for property matching
- On-line weighted pattern matching
- Log-logarithmic worst-case range queries are possible in space theta(N)
- On-line construction of suffix trees
- Pattern matching and consensus problems on weighted sequences and profiles
- Property suffix array with applications
- Faster index for property matching
- Weighted Ancestors in Suffix Trees
- Dynamic text and static pattern matching
- On-Line Pattern Matching on Uncertain Sequences and Applications
- Time-Optimal Top-$k$ Document Retrieval
- Fast Algorithms for Finding Nearest Common Ancestors
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Probability Inequalities for Sums of Bounded Random Variables
- Fast Average-Case Pattern Matching on Weighted Sequences
- Algorithms on Strings
- On the sorting-complexity of suffix tree construction
- Lowest common ancestors in trees and directed acyclic graphs
