Approximate string matching with gaps

Authors:
Maxime Crochemore;Costas Iliopoulos;Christos Makris;Wojciech Rytter;Athanasios Tsakalidis;Kostas Tsichlas
Affiliations:
Institut Gaspard Monge Université de Marne-la-Vallée CEDEX 2, France;Dept. Computer Science King's College London London WC2R 2LS, England and School of Computing, Curtin University of Technology, GPO Box 1987 U, WA, Australia;Computer Engineering & Informatics Dept. of University of Patras and Computer Technology Institute (CTI) P.O. BOX 26500, Rio, Greece;Uniwersytet Warszawski Banacha2, 02-097 Warszawa, Poland and Department of Computer Science, University of Liverpool, Liverpool L69 7ZF, UK;Computer Engineering & Informatics Department of University of Patras and Computer Technology Institute (CTI) P.O. BOX 26500, Rio, Greece;Computer Engineering & Informatics Department of University of Patras and Computer Technology Institute (CTI) P.O. BOX 26500, Rio, Greece
Venue:
Nordic Journal of Computing
Year:
2002

Citing 6
Cited 15

Deques with heap order

Information Processing Letters
Fast string searching

Software—Practice & Experience
A linear space algorithm for computing maximal common subsequences

Communications of the ACM
Identifying Periodic Occurrences of a Template with Applications to Protein Structures

CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
Episode Matching

CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
A Very Fast String Matching Algorithm for Small Alphabeths and Long Patterns (Extended Abstract)

CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching

Algorithms for Transposition Invariant String Matching

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Data structuring application for string problems in biological sequences

ICCMSE '03 Proceedings of the international conference on Computational methods in sciences and engineering
Occurrence and substring heuristics for δ-matching

Fundamenta Informaticae - Special issue on computing patterns in strings
Transposition invariant string matching

Journal of Algorithms
Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance

Information Retrieval
Discovering regularities in biosequences: Challenges and applications

Journal of Computational Methods in Sciences and Engineering
Transposition invariant string matching

Journal of Algorithms
Filtering methods for content-based retrieval on indexed symbolic music databases

Information Retrieval
On minimizing pattern splitting in multi-track string matching

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
String matching with variable length gaps

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Indexing with gaps

SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Efficient bit-parallel algorithms for (δ, α)-matching

WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Efficient algorithms for pattern matching with general gaps and character classes

SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
String matching with variable length gaps

Theoretical Computer Science
A survey of query-by-humming similarity methods

Proceedings of the 5th International Conference on PErvasive Technologies Related to Assistive Environments

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider several new versions of approximate string matching with gaps. The main characteristic of these new versions is the existence of gaps in the matching of a given pattern in a text. Algorithms are devised for each version and their time and space complexities are stated. These specific versions of approximate string matching have various applications in computerized music analysis.