String Processing and Information Retrieval - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540297406, 9783540322412

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/11575832_20 ◽

2005 ◽

pp. 179-190 ◽

Cited By ~ 7

Author(s):

Pierre Peterlongo ◽

Nadia Pisanti ◽

Frederic Boyer ◽

Marie-France Sagot

Keyword(s):

Data Structure

Download Full-text

Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/11575832_14 ◽

2005 ◽

pp. 127-138 ◽

Cited By ~ 14

Author(s):

Rodrigo Paredes ◽

Edgar Chávez

Keyword(s):

Metric Spaces ◽

Nearest Neighbor ◽

K Nearest Neighbor ◽

Neighbor Graph ◽

Nearest Neighbor Graph

Download Full-text

Recommending Better Queries from Click-Through Data

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/11575832_5 ◽

2005 ◽

pp. 41-44 ◽

Cited By ~ 4

Author(s):

Georges Dupret ◽

Marcelo Mendoza

Download Full-text

Normalized Similarity of RNA Sequences

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/11575832_40 ◽

2005 ◽

pp. 360-369 ◽

Cited By ~ 2

Author(s):

Rolf Backofen ◽

Danny Hermelin ◽

Gad M. Landau ◽

Oren Weimann

Keyword(s):

Rna Sequences

Download Full-text

L 1 Pattern Matching Lower Bound

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/11575832_36 ◽

2005 ◽

pp. 327-330 ◽

Cited By ~ 2

Author(s):

Ohad Lipsky ◽

Ely Porat

Keyword(s):

Lower Bound ◽

Pattern Matching

Download Full-text

Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/11575832_35 ◽

2005 ◽

pp. 315-326 ◽

Cited By ~ 2

Author(s):

Jin Wook Kim ◽

Amihood Amir ◽

Gad M. Landau ◽

Kunsoo Park

Keyword(s):

Run Length

Download Full-text

Necklace Swap Problem for Rhythmic Similarity Measures

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/11575832_27 ◽

2005 ◽

pp. 234-245

Author(s):

Yoan José Pinzón Ardila ◽

Raphaël Clifford ◽

Manal Mohamed

Keyword(s):

Similarity Measures

Download Full-text

Retrieval Status Values in Information Retrieval Evaluation

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/11575832_25 ◽

2005 ◽

pp. 224-227 ◽

Cited By ~ 1

Author(s):

Amélie Imafouo ◽

Xavier Tannier

Keyword(s):

Information Retrieval ◽

Information Retrieval Evaluation

Download Full-text

Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/11575832_34 ◽

2005 ◽

pp. 301-314

Author(s):

Lasse Bergroth

Keyword(s):

Longest Common Subsequence ◽

Longest Common Subsequence Problem ◽

Common Subsequence

Download Full-text

Restricted Transposition Invariant Approximate String Matching Under Edit Distance

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/11575832_29 ◽

2005 ◽

pp. 256-266 ◽

Cited By ~ 1

Author(s):

Heikki Hyyrö

Keyword(s):

Edit Distance ◽

String Matching ◽

Approximate String Matching

Download Full-text

String Processing and Information Retrieval - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array

Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces

Recommending Better Queries from Click-Through Data

Normalized Similarity of RNA Sequences

L 1 Pattern Matching Lower Bound

Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty

Necklace Swap Problem for Rhythmic Similarity Measures

Retrieval Status Values in Information Retrieval Evaluation

Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem

Restricted Transposition Invariant Approximate String Matching Under Edit Distance

String Processing and Information Retrieval - Lecture Notes in Computer Science
Latest Publications