CPM
15 years 22 days ago
2006 Springer 
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...
CPM
15 years 22 days ago
2006 Springer 
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...
CPM
15 years 22 days ago
2006 Springer
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 ...
CPM
15 years 22 days ago
2006 Springer  CPM
15 years 22 days ago
2006 Springer 
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
|
Combinatorics