1421 search results - page 42 / 285 » Algorithms for subsequence combinatorics |
137
Voted
CPM
1998
Springer
15 years 7 months ago
1998
Springer
While much work has been done on determining if a document or a line of a document contains an exact or approximate match to a regular expression, less e ort has been expended in ...
134
Voted
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
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...
128
Voted
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
124
Voted
CPM
2005
Springer
15 years 4 months ago
2005
Springer
We present efficient sensitivity-analysis algorithms for two problems involving Markov models of sequence evolution: ancestral reconstruction in evolutionary trees and local ungap...
144
Voted
COCOON
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...