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

9783540232100, 9783540302131

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Automaton-Based Sublinear Keyword Pattern Matching

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

10.1007/978-3-540-30213-1_3 ◽

2004 ◽

pp. 18-29 ◽

Cited By ~ 2

Author(s):

Loek Cleophas ◽

Bruce W. Watson ◽

Gerard Zwaan

Keyword(s):

Pattern Matching

Download Full-text

Efficient One Dimensional Real Scaled Matching

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

10.1007/978-3-540-30213-1_1 ◽

2004 ◽

pp. 1-9 ◽

Cited By ~ 4

Author(s):

Amihood Amir ◽

Ayelet Butman ◽

Moshe Lewenstein ◽

Ely Porat ◽

Dekel Tsur

Keyword(s):

One Dimensional

Download Full-text

Negations and Document Length in Logical Retrieval

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

10.1007/978-3-540-30213-1_27 ◽

2004 ◽

pp. 196-207

Author(s):

David E. Losada ◽

Alvaro Barreiro

Download Full-text

Evaluating Relevance Feedback and Display Strategies for Searching on Small Displays

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

10.1007/978-3-540-30213-1_19 ◽

2004 ◽

pp. 131-133 ◽

Cited By ~ 3

Author(s):

Vishwa Vinay ◽

Ingemar J. Cox ◽

Natasa Milic-Frayling ◽

Ken Wood

Keyword(s):

Relevance Feedback

Download Full-text

DDOC: Overlapping Clustering of Words for Document Classification

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

10.1007/978-3-540-30213-1_17 ◽

2004 ◽

pp. 127-128

Author(s):

Guillaume Cleuziou ◽

Lionel Martin ◽

Viviane Clavier ◽

Christel Vrain

Keyword(s):

Document Classification ◽

Overlapping Clustering

Download Full-text

Bit-Parallel Branch and Bound Algorithm for Transposition Invariant LCS

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

10.1007/978-3-540-30213-1_10 ◽

2004 ◽

pp. 74-75

Author(s):

Kjell Lemström ◽

Gonzalo Navarro ◽

Yoan Pinzon

Keyword(s):

Branch And Bound ◽

Branch And Bound Algorithm ◽

Parallel Branch And Bound

Download Full-text

Efficient Computation of Balancedness in Binary Sequence Generators

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

10.1007/978-3-540-30213-1_38 ◽

2004 ◽

pp. 269-270

Author(s):

Pedro García-Mochales ◽

Amparo Fúster-Sabater

Keyword(s):

Binary Sequence ◽

Efficient Computation

Download Full-text

Techniques for Efficient Query Expansion

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

10.1007/978-3-540-30213-1_4 ◽

2004 ◽

pp. 30-42 ◽

Cited By ~ 6

Author(s):

Bodo Billerbeck ◽

Justin Zobel

Keyword(s):

Query Expansion

Download Full-text

Longest Motifs with a Functionally Equivalent Central Block

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

10.1007/978-3-540-30213-1_42 ◽

2004 ◽

pp. 298-309

Author(s):

Maxime Crochemore ◽

Raffaele Giancarlo ◽

Marie-France Sagot

Keyword(s):

Central Block

Download Full-text

Motif Extraction from Weighted Sequences

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

10.1007/978-3-540-30213-1_41 ◽

2004 ◽

pp. 286-297 ◽

Cited By ~ 4

Author(s):

Costas S. Iliopoulos ◽

Katerina Perdikuri ◽

Evangelos Theodoridis ◽

Athanasios Tsakalidis ◽

Kostas Tsichlas

Keyword(s):

Motif Extraction ◽

Weighted Sequences

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Automaton-Based Sublinear Keyword Pattern Matching

Efficient One Dimensional Real Scaled Matching

Negations and Document Length in Logical Retrieval

Evaluating Relevance Feedback and Display Strategies for Searching on Small Displays

DDOC: Overlapping Clustering of Words for Document Classification

Bit-Parallel Branch and Bound Algorithm for Transposition Invariant LCS

Efficient Computation of Balancedness in Binary Sequence Generators

Techniques for Efficient Query Expansion

Longest Motifs with a Functionally Equivalent Central Block

Motif Extraction from Weighted Sequences

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