Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > String Processing and Information Retrieval: 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings > Bit-Parallel Approximate String Matching Algorithms with Transposition
String Processing and Information Retrieval: 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings |
Mario A. Nascimento; Edleno S. de Moura; Arlindo L. Oliveira
Springer Berlin Heidelberg
String Processing and Information Retrieval: 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings
Bit-Parallel Approximate String Matching Algorithms with Transposition
Authors

Heikki Hyyrö

ARI Id

1664805028483_3294564

Access

Not Available Free

Pages

95-107

DOI

10.1007/978-3-540-39984-1_8

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-540-39984-1_8

Table of Contents of Book
Showing 1 to 20 of 31 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Patterns on the Web
Krishna Bharat
1-15
Current Challenges in Bioinformatics
João Meidanis
16-27
What’s Changed? Measuring Document Change in Web Crawling for Search Engines
Halil Ali; Hugh E. Williams
28-42
Link Information as a Similarity Measure in Web Classification
Marco Cristo; Pável Calado; Edleno Silva de Moura; Nivio Ziviani; Berthier Ribeiro-Neto
43-55
A Three Level Search Engine Index Based in Query Log Distribution
Ricardo Baeza-Yates; Felipe Saint-Jean
56-65
Row-wise Tiling for the Myers’ Bit-Parallel Approximate String Matching Algorithm
Kimmo Fredriksson
66-79
Alternative Algorithms for Bit-Parallel String Matching
Hannu Peltola; Jorma Tarhio
80-93
Bit-Parallel Approximate String Matching Algorithms with Transposition
Heikki Hyyrö
95-107
Processing of Huffman Compressed Texts with a Super-Alphabet
Kimmo Fredriksson; Jorma Tarhio
108-121
(S, C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases
Nieves R. Brisaboa; Antonio Fariña; Gonzalo Navarro; María F. Esteller
122-136
Linear-Time Off-Line Text Compression by Longest-First Substitution
Shunsuke Inenaga; Takashi Funamoto; Masayuki Takeda; Ayumi Shinohara
137-152
SCM: Structural Contexts Model for Improving Compression in Semistructured Text Databases
Joaquín Adiego; Gonzalo Navarro; Pablo de la Fuente
153-167
Ranking Structured Documents Using Utility Theory in the Bayesian Network Retrieval Model
Fabio Crestani; Luis M. de Campos; Juan M. Fernández-Luna; Juan F. Huete
168-182
An Empirical Comparison of Text Categorization Methods
Ana Cardoso-Cachopo; Arlindo L. Oliveira
183-196
Improving Text Retrieval in Medical Collections Through Automatic Categorization
Rodrigo F. Vale; Berthier A. Ribeiro-Neto; Luciano R. S. de Lima; Alberto H. F. Laender; Hermes R. F. Junior
197-210
A Bit-Parallel Suffix Automaton Approach for (δ, γ)-Matching in Music Retrieval
Maxime Crochemore; Costas S. Iliopoulos; Gonzalo Navarro; Yoan J. Pinzon
211-223
Flexible and Efficient Bit-Parallel Techniques for Transposition Invariant Approximate Matching in Music Retrieval
Kjell Lemström; Gonzalo Navarro
224-237
FindStem: Analysis and Evaluation of a Turkish Stemming Algorithm
Hayri Sever; Yıltan Bitirim
238-251
Non-adjacent Digrams Improve Matching of Cross-Lingual Spelling Variants
Heikki Keskustalo; Ari Pirkola; Kari Visala; Erkka Leppänen; Kalervo Järvelin
252-265
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 31 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings