Approximate string-matching with q-grams and maximal matches
From MaRDI portal
(Redirected from Publication:1190465)
Approximate string-matching with \(q\)-grams and maximal matches
Approximate string-matching with \(q\)-grams and maximal matches
Recommendations
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 4078846 (Why is no real title available?)
- scientific article; zbMATH DE number 176144 (Why is no real title available?)
- scientific article; zbMATH DE number 4119620 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- A Mathematical Theory of Communication
- A Space-Economical Suffix Tree Construction Algorithm
- A new distance metric on strings computable in linear time
- Algorithms for approximate string matching
- Boyer-Moore approach to approximate string matching
- Data structures and algorithms for approximate string matching
- Efficient randomized pattern-matching algorithms
- Fast parallel and serial approximate string matching
- Fast string matching with k differences
- Finding approximate patterns in strings
- Simple and efficient string matching with k mismatches
- Sublinear approximate string matching and biological applications
- The String-to-String Correction Problem
- The smallest automaton recognizing the subwords of a text
- The theory and computation of evolutionary distances: Pattern recognition
- Transducers and repetitions
Cited in
(37)- A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS
- Compact q-gram profiling of compressed strings
- Algorithms for finding a most similar subforest
- On-line approximate string matching with bounded errors
- Combinatorics of periods in strings.
- Estimating sequence similarity from read sets for clustering next-generation sequencing data
- Finite automata for testing composition-based reconstructibility of sequences
- The interlace polynomial of a graph
- Hardness of optimal spaced seed design
- On using q-gram locations in approximate string matching
- Multiple filtration and approximate pattern matching
- scientific article; zbMATH DE number 2149348 (Why is no real title available?)
- scientific article; zbMATH DE number 826062 (Why is no real title available?)
- Average complexity of backward \(q\)-gram string matching algorithms
- Euler circuits and DNA sequencing by hybridization
- Circular sequence comparison with \(q\)-grams
- A subquadratic algorithm for approximate limited expression matching
- Vector representations for efficient comparison and search for similar strings
- Investigation of accelerated search for close text sequences with the help of vector representations
- A bracket polynomial for graphs. IV: Undirected Euler circuits, graph-links and multiply marked graphs
- Fast and linear-time string matching algorithms based on the distances of \(q\)-gram occurrences
- On pattern occurrences in a random text
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results
- Characterizing the reconstruction and enumerating the patterns of DNA sequences with re\-peats
- Fast approximate search in large dictionaries
- Binary matroids and local complementation
- What's behind blast
- String reconstruction from substring compositions
- An approximate string-matching algorithm
- Average-case linear-time similar substring searching by the \(q\)-gram distance
- DNA physical mapping and alternating Eulerian cycles in colored graphs
- Shuffling biological sequences
- New and faster filters for multiple approximate string matching
- Approximate joins for XML at label level
- A new filtration method and a hybrid strategy for approximate string matching
- On the string matching with \(k\) mismatches
- Surprises in approximating Levenshtein distances
This page was built for publication: Approximate string-matching with \(q\)-grams and maximal matches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190465)
