Fast and simple computations using prefix tables under Hamming and edit distance
From MaRDI portal
Publication:2946041
DOI10.1007/978-3-319-19315-1_5zbMATH Open1396.68037OpenAlexW1766660969MaRDI QIDQ2946041FDOQ2946041
Authors: Carl Barton, Costas S. Iliopoulos, Solon P. Pissis, W. F. Smyth 
Publication date: 15 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-19315-1_5
Recommendations
Cites Work
- Title not available (Why is that?)
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Title not available (Why is that?)
- An O(n log n) algorithm for finding all repetitions in a string
- Generalized String Matching
- Incremental String Comparison
- Algorithms on Strings
- The longest common extension problem revisited and applications to approximate string searching
- Prefix table construction and conversion
- Title not available (Why is that?)
- Inducing the LCP-array
- Title not available (Why is that?)
- Average-optimal single and multiple approximate string matching
- Finding all approximate gapped palindromes
- Approximate All-Pairs Suffix/Prefix Overlaps
- Construction of Aho Corasick automaton in linear time for integer alphabets
Cited In (6)
- Efficient identification of \(k\)-closed strings
- Linear-time computation of prefix table for weighted strings
- Approximate all-pairs suffix/prefix overlaps
- Checking whether a word is Hamming-isometric in linear time
- Prefix table construction and conversion
- Linear-time computation of prefix table for weighted strings {\&} applications
This page was built for publication: Fast and simple computations using prefix tables under Hamming and edit distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946041)
