Compressed indexes for approximate string matching

Efficient and adaptive processing of multiple continuous queries

Tok, W.H.
Bressan, S.

January 2002

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Approximate String Matching with Compressed Indexes

Luís M. S. Russo

September 2009

A compressed full-text self-index for a text T is a data structure requiring reduced space and able ...

Approximate String Matching with Compressed Indexes

Pedro Morales
Arlindo L. Oliveira
Luís M. S. Russo
Gonzalo Navarro

September 2009

A compressed full-text self-index for a text T is a data structure requiring reduced space and able ...

Improved approximate string matching using compressed suffix data structures

Lam, T.-W.
Sung, W.-K.
Wong, S.-S.

January 2005

10.1007/11602613_35Lecture Notes in Computer Science (including subseries Lecture Notes in Artificia...

Space efficient indexes for string matching with don't cares

Lam, T.-W.
Sung, W.-K.
Tam, S.-L.
Yiu, S.-M.

January 2007

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

A linear size index for approximate pattern matching

Chan, H.-L.
Lam, T.-W.
Sung, W.-K.
Tam, S.-L.
Wong, S.-S.

January 2006

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

An experimental study of compressed indexing and local alignments of DNA

Lam, T.-W.
Sung, W.-K.
Tam, S.-L.
Wong, C.-K.
Yiu, S.-M.

January 2007

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Constructing compressed suffix arrays with large alphabets

Hon, W.-K.
Lam, T.-W.
Sadakane, K.
Sung, W.-K.

January 2003

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Extraction in scientific publications

Nguyen, T.D.
Kan, M.-Y.

January 2007

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Index sets and universal numberings

Jain, S.
Stephan, F.
Teutsch, J.

January 2009

10.1007/978-3-642-03073-4_28Lecture Notes in Computer Science (including subseries Lecture Notes in ...

Progressive high-dimensional similarity join

Tok, W.H.
Bressan, S.
Lee, M.-L.

January 2007

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Compressed dynamic tries with applications to LZ-compression in sublinear time and space

Jansson, J.
Sadakane, K.
Sung, W.-K.

January 2007

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Succinct data structures for Searchable Partial Sums

Hon, W.-K.
Sadakane, K.
Sung, W.-K.

January 2003

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Manifestation and exploitation of invariants in bioinformatics

Wong, L.

January 2007

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Relative safety

Jaffar, J.
Santosa, A.E.
Voicu, R.

January 2006

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Efficient and adaptive processing of multiple continuous queries

Tok, W.H.
Bressan, S.

January 2002

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Approximate String Matching with Compressed Indexes

Luís M. S. Russo

September 2009

A compressed full-text self-index for a text T is a data structure requiring reduced space and able ...

Approximate String Matching with Compressed Indexes

Pedro Morales
Arlindo L. Oliveira
Luís M. S. Russo
Gonzalo Navarro

September 2009

A compressed full-text self-index for a text T is a data structure requiring reduced space and able ...

Improved approximate string matching using compressed suffix data structures

Lam, T.-W.
Sung, W.-K.
Wong, S.-S.

January 2005

10.1007/11602613_35Lecture Notes in Computer Science (including subseries Lecture Notes in Artificia...

Space efficient indexes for string matching with don't cares

Lam, T.-W.
Sung, W.-K.
Tam, S.-L.
Yiu, S.-M.

January 2007

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

A linear size index for approximate pattern matching

Chan, H.-L.
Lam, T.-W.
Sung, W.-K.
Tam, S.-L.
Wong, S.-S.

January 2006

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

An experimental study of compressed indexing and local alignments of DNA

Lam, T.-W.
Sung, W.-K.
Tam, S.-L.
Wong, C.-K.
Yiu, S.-M.

January 2007

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Constructing compressed suffix arrays with large alphabets

Hon, W.-K.
Lam, T.-W.
Sadakane, K.
Sung, W.-K.

January 2003

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Extraction in scientific publications

Nguyen, T.D.
Kan, M.-Y.

January 2007

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Index sets and universal numberings

Jain, S.
Stephan, F.
Teutsch, J.

January 2009

10.1007/978-3-642-03073-4_28Lecture Notes in Computer Science (including subseries Lecture Notes in ...

Progressive high-dimensional similarity join

Tok, W.H.
Bressan, S.
Lee, M.-L.

January 2007

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Compressed dynamic tries with applications to LZ-compression in sublinear time and space

Jansson, J.
Sadakane, K.
Sung, W.-K.

January 2007

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Succinct data structures for Searchable Partial Sums

Hon, W.-K.
Sadakane, K.
Sung, W.-K.

January 2003

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Manifestation and exploitation of invariants in bioinformatics

Wong, L.

January 2007

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Relative safety

Jaffar, J.
Santosa, A.E.
Voicu, R.

January 2006

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Efficient and adaptive processing of multiple continuous queries

Tok, W.H.
Bressan, S.

January 2002

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Approximate String Matching with Compressed Indexes

Luís M. S. Russo

September 2009

A compressed full-text self-index for a text T is a data structure requiring reduced space and able ...

Approximate String Matching with Compressed Indexes

Pedro Morales
Arlindo L. Oliveira
Luís M. S. Russo
Gonzalo Navarro

September 2009

A compressed full-text self-index for a text T is a data structure requiring reduced space and able ...

Compressed indexes for approximate string matching

Abstract

Extracted data

Compressed indexes for approximate string matching

Abstract

Extracted data

Related items

Related items