1421 search results - page 54 / 285 » Algorithms for subsequence combinatorics |
134
click to vote
IPL
2008
15 years 2 months ago
2008
The longest common subsequence and sequence alignment problems have been studied extensively and they can be regarded as the relationship measurement between sequences. However, m...
107
click to vote
CORR
2002
Springer
15 years 2 months ago
2002
Springer
an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (ai, wi) for i = 1, . . . , n and wi > 0, a segment A(i, j) is a consecu...
100
Voted
COCOON
2001
Springer
15 years 7 months ago
2001
Springer
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
140
click to vote
CPM
2006
Springer
15 years 6 months 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...
112
click to vote
RECOMB
2001
Springer
16 years 3 months ago
2001
Springer
In proteomics 2?dimensional gel electrophoresis (2?DE) is a separation technique for proteins. The resulting protein spots can be identified by either using picking robots and sub...