Sciweavers

CPM
2006
Springer
182views Combinatorics» more  CPM 2006»
15 years 19 days ago
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
Johannes Fischer, Volker Heun
CPM
2006
Springer
176views Combinatorics» more  CPM 2006»
15 years 19 days ago
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
Alexandre Tiskin
CPM
2006
Springer
175views Combinatorics» more  CPM 2006»
15 years 19 days ago
On-Line Linear-Time Construction of Word Suffix Trees
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
Shunsuke Inenaga, Masayuki Takeda
COCOON
2006
Springer
15 years 19 days ago
Reconciling Gene Trees with Apparent Polytomies
We consider the problem of reconciling gene trees with a species tree based on the widely accepted Gene Duplication model from Goodman et al. Current algorithms that solve this pro...
Wen-Chieh Chang 0002, Oliver Eulenstein
CPM
2006
Springer
164views Combinatorics» more  CPM 2006»
15 years 19 days ago
Dynamic Entropy-Compressed Sequences and Full-Text Indexes
Veli Mäkinen, Gonzalo Navarro
Combinatorics
Top of PageReset Settings