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

9783642037832, 9783642037849

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On Entropy-Compressed Text Indexing in External Memory

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

10.1007/978-3-642-03784-9_8 ◽

2009 ◽

pp. 75-89 ◽

Cited By ~ 12

Author(s):

Wing-Kai Hon ◽

Rahul Shah ◽

Sharma V. Thankachan ◽

Jeffrey Scott Vitter

Keyword(s):

External Memory ◽

Text Indexing

Download Full-text

Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees

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

10.1007/978-3-642-03784-9_2 ◽

2009 ◽

pp. 7-17 ◽

Cited By ~ 2

Author(s):

Daiji Fukagawa ◽

Tatsuya Akutsu ◽

Atsuhiro Takasu

Keyword(s):

Edit Distance ◽

Constant Factor ◽

Unordered Trees

Download Full-text

Indexing Variable Length Substrings for Exact and Approximate Matching

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

10.1007/978-3-642-03784-9_21 ◽

2009 ◽

pp. 214-221 ◽

Cited By ~ 2

Author(s):

Gonzalo Navarro ◽

Leena Salmela

Keyword(s):

Variable Length ◽

Approximate Matching

Download Full-text

Range Quantile Queries: Another Virtue of Wavelet Trees

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

10.1007/978-3-642-03784-9_1 ◽

2009 ◽

pp. 1-6 ◽

Cited By ~ 39

Author(s):

Travis Gagie ◽

Simon J. Puglisi ◽

Andrew Turpin

Download Full-text

A Comparison of Data-Driven Automatic Syllabification Methods

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

10.1007/978-3-642-03784-9_17 ◽

2009 ◽

pp. 174-181 ◽

Cited By ~ 4

Author(s):

Connie R. Adsett ◽

Yannick Marchand

Keyword(s):

Data Driven ◽

Automatic Syllabification

Download Full-text

Syntactic Query Models for Restatement Retrieval

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

10.1007/978-3-642-03784-9_14 ◽

2009 ◽

pp. 143-155 ◽

Cited By ~ 1

Author(s):

Niranjan Balasubramanian ◽

James Allan

Download Full-text

Identifying the Intent of a User Query Using Support Vector Machines

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

10.1007/978-3-642-03784-9_13 ◽

2009 ◽

pp. 131-142 ◽

Cited By ~ 6

Author(s):

Marcelo Mendoza ◽

Juan Zamora

Keyword(s):

Support Vector Machines ◽

Support Vector ◽

User Query ◽

Vector Machines

Download Full-text

A Compressed Enhanced Suffix Array Supporting Fast String Matching

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

10.1007/978-3-642-03784-9_6 ◽

2009 ◽

pp. 51-62 ◽

Cited By ~ 13

Author(s):

Enno Ohlebusch ◽

Simon Gog

Keyword(s):

String Matching ◽

Suffix Array

Download Full-text

On-Line Construction of Parameterized Suffix Trees

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

10.1007/978-3-642-03784-9_4 ◽

2009 ◽

pp. 31-38 ◽

Cited By ~ 1

Author(s):

Taehyung Lee ◽

Joong Chae Na ◽

Kunsoo Park

Keyword(s):

Suffix Trees ◽

On Line ◽

Line Construction

Download Full-text

Faster Algorithms for Sampling and Counting Biological Sequences

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

10.1007/978-3-642-03784-9_24 ◽

2009 ◽

pp. 243-253

Author(s):

Christina Boucher

Keyword(s):

Biological Sequences

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

On Entropy-Compressed Text Indexing in External Memory

Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees

Indexing Variable Length Substrings for Exact and Approximate Matching

Range Quantile Queries: Another Virtue of Wavelet Trees

A Comparison of Data-Driven Automatic Syllabification Methods

Syntactic Query Models for Restatement Retrieval

Identifying the Intent of a User Query Using Support Vector Machines

A Compressed Enhanced Suffix Array Supporting Fast String Matching

On-Line Construction of Parameterized Suffix Trees

Faster Algorithms for Sampling and Counting Biological Sequences

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