COCOON
1995
Springer
13 years 7 months ago
1995
Springer
COCOC
1995
13 years 7 months ago
1995
COCOC
1995
13 years 7 months ago
1995
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree o...
COCOON
1997
Springer
13 years 7 months ago
1997
Springer
CPM
2000
Springer
13 years 8 months ago
2000
Springer
CPM
2000
Springer
13 years 8 months ago
2000
Springer
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
COCOON
2001
Springer
13 years 8 months ago
2001
Springer
COCOON
2010
Springer
13 years 8 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
CPM
2006
Springer
13 years 8 months ago
2006
Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
CPM
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...