There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 25

Record: found
Abstract: not found
Article: not found

A guided tour to approximate string matching

Gonzalo Navarro (2001)

0 comments Cited 219 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

On-line construction of suffix trees

E Ukkonen (1995)

0 comments Cited 153 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

A fast bit-vector algorithm for approximate string matching based on dynamic programming

Gene Myers (1999)

0 comments Cited 80 times – based on 0 reviews      Review now

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 2017

Publication date (Online): August 16 2017

Pages: 164-176

DOI: 10.1007/978-3-662-55751-8_14

SO-VID: 1bafa602-b9ea-479a-9425-9df5c7890505

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 5

See all cited by

Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching

Read this book at

Related collections

Cardiovascular Innovations and Applications

Most cited references 25

A guided tour to approximate string matching

On-line construction of suffix trees

A fast bit-vector algorithm for approximate string matching based on dynamic programming

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 2,736

Cited by 5