CPM 2008 | Sciweavers

48

CPM
2008
Springer

112views Combinatorics» more CPM 2008»

Computing Inverse ST in Linear Complexity

14 years 4 months ago

The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...

Ge Nong, Sen Zhang, Wai Hong Chan

claim paper

Read More »

31

click to vote

CPM
2008
Springer

112views Combinatorics» more CPM 2008»

Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics

14 years 4 months ago

Download www.cs.ucr.edu

Tobias Marschall, Sven Rahmann

claim paper

Read More »

39

click to vote

CPM
2008
Springer

139views Combinatorics» more CPM 2008»

Lower Bounds for Succinct Data Structures

14 years 4 months ago

Download people.csail.mit.edu

J. Ian Munro

claim paper

Read More »

34

click to vote

CPM
2008
Springer

126views Combinatorics» more CPM 2008»

An(other) Entropy-Bounded Compressed Suffix Tree

14 years 4 months ago

Download www.cs.ucr.edu

Johannes Fischer, Veli Mäkinen, Gonzalo Navar...

claim paper

Read More »

48

click to vote

CPM
2008
Springer

148views Combinatorics» more CPM 2008»

On-Line Approximate String Matching with Bounded Errors

14 years 4 months ago

Download www.dcc.uchile.cl

We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...

Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha

claim paper

Read More »

38

click to vote

CPM
2008
Springer

149views Combinatorics» more CPM 2008»

On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices

14 years 4 months ago

Download hpc.isti.cnr.it

Let G be an unweighted and undirected graph of n nodes, and let D be the n

Igor Nitto, Rossano Venturini

claim paper

Read More »

32

click to vote

CPM
2008
Springer

123views Combinatorics» more CPM 2008»

A Linear Delay Algorithm for Building Concept Lattices

14 years 4 months ago

Download www.cs.ucr.edu

Martin Farach-Colton, Yang Huang

claim paper

Read More »

36

click to vote

CPM
2008
Springer

132views Combinatorics» more CPM 2008»

Constrained LCS: Hardness and Approximation

14 years 4 months ago

Download cs.haifa.ac.il

Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein

claim paper

Read More »

49

click to vote

CPM
2008
Springer

143views Combinatorics» more CPM 2008»

A Black Box for Online Approximate Pattern Matching

14 years 4 months ago

Download www.wisdom.weizmann.ac.il

Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...

Raphaël Clifford, Klim Efremenko, Benny Porat...

claim paper

Read More »

30

click to vote

CPM
2008
Springer

129views Combinatorics» more CPM 2008»

Fast Algorithms for Computing Tree LCS

14 years 4 months ago