Sciweavers

Share
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
8 years 5 months ago
Computing Inverse ST in Linear Complexity
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
CPM
2008
Springer
126views Combinatorics» more  CPM 2008»
8 years 5 months ago
An(other) Entropy-Bounded Compressed Suffix Tree
Johannes Fischer, Veli Mäkinen, Gonzalo Navar...
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
8 years 5 months ago
On-Line Approximate String Matching with Bounded Errors
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
CPM
2008
Springer
149views Combinatorics» more  CPM 2008»
8 years 5 months ago
On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
Let G be an unweighted and undirected graph of n nodes, and let D be the n
Igor Nitto, Rossano Venturini
CPM
2008
Springer
123views Combinatorics» more  CPM 2008»
8 years 5 months ago
A Linear Delay Algorithm for Building Concept Lattices
Martin Farach-Colton, Yang Huang
CPM
2008
Springer
132views Combinatorics» more  CPM 2008»
8 years 5 months ago
Constrained LCS: Hardness and Approximation
Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein
CPM
2008
Springer
143views Combinatorics» more  CPM 2008»
8 years 5 months ago
A Black Box for Online Approximate Pattern Matching
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...
CPM
2008
Springer
129views Combinatorics» more  CPM 2008»
8 years 5 months ago
Fast Algorithms for Computing Tree LCS
Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-U...
books