Elastic-degenerate string matching with 1 error or mismatch

DOI10.1007/S00224-024-10194-8MaRDI QIDQ6635705zbMATH OpenFDO

Authors Giulia Bernardini, Esteban Gabory, Solon P. Pissis, L. Stougie, Michelle Sweering, Wiktor Zuba

Publication date 12 November 2024

Published in Theory of Computing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

Hamming distanceedit distancestring algorithmsapproximate string matchingelastic-degenerate strings

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Theory of data (68Pxx)

Cites work

• scientific article; zbMATH DE number 1512678 (Why is no real title available?)
• scientific article; zbMATH DE number 7286689 (Why is no real title available?)
• scientific article; zbMATH DE number 7651193 (Why is no real title available?)
• scientific article; zbMATH DE number 7788593 (Why is no real title available?)
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• A data structure for dynamic trees
• Algorithms on Strings
• An Efficient Elastic-Degenerate Text Index? Not Likely
• Approximate String Matching: A Simpler Faster Algorithm
• Approximate pattern matching on elastic-degenerate text
• Comparing Degenerate Strings
• Constructing Efficient Dictionaries in Close to Sorting Time
• Degenerate string comparison and applications
• Dictionary matching and indexing with errors and don't cares
• Efficient string matching with k mismatches
• Elastic-Degenerate String Matching via Fast Matrix Multiplication
• Elastic-degenerate string matching with 1 error
• Even faster elastic-degenerate string matching via fast matrix multiplication
• Fast string matching with k differences
• Faster Online Elastic Degenerate String Matching
• Faster algorithms for string matching with k mismatches
• Improved approximate pattern matching on hypertext
• Linear time construction of indexable founder block graphs
• Novel Transformation Techniques Using Q-Heaps with Applications to Computational Geometry
• On Indeterminate Strings Matching.
• On the Complexity of String Matching for Graphs
• On-line pattern matching on similar texts
• Orthogonal range searching on the RAM, revisited
• Pattern Matching in Hypertext
• Property Suffix Array with Applications in Indexing Weighted Sequences
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Text Indexing and Dictionary Matching with One Error
• Towards unified approximate pattern matching for Hamming and \(L_1\) distance
• Truncated suffix trees and their application to data compression.

This page was built for publication: Elastic-degenerate string matching with 1 error or mismatch

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635705)