2654 search results - page 149 / 531 » On Pairing Inversion Problems |
150
click to vote
TCS
2008
15 years 6 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
188
click to vote
LION
2007
Springer
16 years 8 days ago
2007
Springer
The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective prob...
166
click to vote
ESA
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
253
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
224
click to vote
APPROX
2000
Springer
15 years 10 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...