1421 search results - page 60 / 285 » Algorithms for subsequence combinatorics |
98
Voted
COCOON
2010
Springer
15 years 7 months ago
2010
Springer
We are given a trajectory T and an area A. T might intersect A several times, and our aim is to detect whether T visits A with some regularity, e.g. what is the longest time span t...
131
click to vote
CPM
2000
Springer
15 years 7 months ago
2000
Springer
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...
105
click to vote
CPM
1999
Springer
15 years 7 months ago
1999
Springer
In sequencing by hybridization (SBH), one has to reconstruct a sequence from its l-long substrings. SBH was proposed as an alternative to gel-based DNA sequencing approaches, but ...
144
click to vote
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
We study an on-line broadcast scheduling problem in which requests have deadlines, and the objective is to maximize the weighted throughput, i.e., the weighted total length of the ...
151
click to vote
COCOON
2005
Springer
15 years 4 months ago
2005
Springer
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...