article · 2013

Approximate String Matching

Brad Harris

Cited by 0Abstract and details only

Abstract

The problem of string matching is very simply stated. Given a body of text T[1…n] we try to find a pattern P[1…m] where m ≤ n. This can be used to search bodies of text for specific patterns, or in biology, can be used to search strands of DNA for specific sequences of genes. The problem of exact string matching has

Cite this paper

APA 7

Harris, B. (2013). Approximate String Matching.

MLA 9

Harris, Brad. “Approximate String Matching.” 2013.

Chicago

Harris, Brad. 2013. “Approximate String Matching.”

Harvard

Harris, B. (2013) ‘Approximate String Matching’.

BibTeX

@article{harris2013approximate,
  title = {{Approximate String Matching}},
  author = {Harris, Brad},
  year = {2013}
}

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