Sublinear approximate string matching and biological applications
From MaRDI portal
Cites work
- A Space-Economical Suffix Tree Construction Algorithm
- An Improved Algorithm For Approximate String Matching
- An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
- Approximate string matching with suffix automata
- Data structures and algorithms for approximate string matching
- Efficient randomized pattern-matching algorithms
- Efficient string matching
- Fast parallel and serial approximate string matching
- Fast Pattern Matching in Strings
- Fast string matching with k differences
- Finding approximate patterns in strings
- scientific article; zbMATH DE number 3913711 (Why is no real title available?)
- scientific article; zbMATH DE number 53467 (Why is no real title available?)
- scientific article; zbMATH DE number 88944 (Why is no real title available?)
- scientific article; zbMATH DE number 4116362 (Why is no real title available?)
- scientific article; zbMATH DE number 4116365 (Why is no real title available?)
- scientific article; zbMATH DE number 742991 (Why is no real title available?)
- scientific article; zbMATH DE number 826056 (Why is no real title available?)
- Inferring Evolutionary History From DNA Sequences
- Linear Algorithm for Data Compression via String Matching
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- The Complexity of Pattern Matching for a Random String
- The theory and computation of evolutionary distances: Pattern recognition
Cited in
(35)- On updating suffix tree labels
- Analysis of two-dimensional approximate pattern matching algorithms
- Approximate string-matching with q-grams and maximal matches
- Block edit models for approximate string matching
- A filtering algorithm for k-mismatch with don't cares
- Longest property-preserved common factor: a new string-processing framework
- Longest common substrings with k mismatches
- Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
- Average-case linear-time similar substring searching by the q-gram distance
- Distributed suffix trees
- The virtual suffix tree
- A new filtration method and a hybrid strategy for approximate string matching
- Bidirectional search in a string with wavelet trees and bidirectional matching statistics
- New and faster filters for multiple approximate string matching
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results
- Multiple approximate string matching
- Quantum pattern matching fast on average
- On using q-gram locations in approximate string matching
- Computing all-vs-all MEMs in run-length-encoded collections of HiFi reads
- On-line approximate string matching with bounded errors
- Computing all-vs-all MEMs in grammar-compressed text
- Frequency-constrained substring complexity
- Matching statistics -- a survey
- MEM-based pangenome indexing for k-mer queries
- Size-constrained weighted ancestors with applications
- Computing MEMs and relatives on repetitive text collections
- On average sequence complexity
- The ceBWT index: an index for circular Cartesian tree matching on multiple texts
- Compressed dictionary matching on run-length encoded strings
- Compressed dictionary matching on run-length encoded strings
- Minimization of deterministic finite automata modulo the edit distance
- Computing suffix links for suffix trees and arrays
- Replacing suffix trees with enhanced suffix arrays
- Text indexing with errors
- Hardness of optimal spaced seed design
This page was built for publication: Sublinear approximate string matching and biological applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336963)
