Home > SOFSEM 2005: Theory and Practice of Computer Science: 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005, Proceedings > Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance
SOFSEM 2005: Theory and Practice of Computer Science: 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005, Proceedings |
Springer Berlin Heidelberg
Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance
Chapter Info
Authors
ARI Id
1664875787774_3883411
Access
Not Available Free
Pages
380-384
DOI
Chapter URL
https://rd.springer.com/chapter/10.1007/978-3-540-30577-4_44
Table of Contents of Book
| Chapters/Headings | Author(s) | Pages | Info |
| Loading... | |||
| Chapters/Headings | Author(s) | Pages | Info |
Similar Books
Loading...
Similar Chapters
Loading...
Similar Thesis
Loading...
Similar News
Loading...
Similar Articles
Loading...
Similar Article Headings
Loading...