1421 search results - page 75 / 285 » Algorithms for subsequence combinatorics |
128
click to vote
RECOMB
1997
Springer
15 years 8 months ago
1997
Springer
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
155
click to vote
WWW
2010
ACM
15 years 11 months ago
2010
ACM
We introduce a new dissimilarity function for ranked lists, the expected weighted Hoeffding distance, that has several advantages over current dissimilarity measures for ranked s...
116
click to vote
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
Many web-based systems have a tiered application architecture, in which a request needs to transverse all the tiers before finishing its processing. One of the most important QoS...
119
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
130
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Clustering video sequences in order to infer and extract activities from a single video stream is an extremely important problem and has significant potential in video indexing, s...