preprint · 2002

Approximate String Matching with Gaps

Maxime Crochemore, Costas S. Iliopoulos, C. Makris, Wojciech Rytter, Athanasios Tsakalidis, K. Tsichlas

Cited by 1Abstract and details only

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 sketched for each version and their time and space complexity is stated. The specific versions of approximate string matching have various applications in computerized music analysis.

Cite this paper

APA 7

Crochemore, M., Iliopoulos, C. S., Makris, C., Rytter, W., Tsakalidis, A., & Tsichlas, K. (2002). Approximate String Matching with Gaps.

MLA 9

Crochemore, Maxime, et al. “Approximate String Matching with Gaps.” 2002.

Chicago

Crochemore, Maxime, Costas S. Iliopoulos, C. Makris, Wojciech Rytter, Athanasios Tsakalidis, and K. Tsichlas. 2002. “Approximate String Matching with Gaps.”

Harvard

Crochemore, M. et al. (2002) ‘Approximate String Matching with Gaps’.

BibTeX

@misc{crochemore2002approximate,
  title = {{Approximate String Matching with Gaps}},
  author = {Crochemore, Maxime and Iliopoulos, Costas S. and Makris, C. and Rytter, Wojciech and Tsakalidis, Athanasios and Tsichlas, K.},
  year = {2002}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.