Sciweavers

57 search results - page 12 / 12
» Inapproximability of the Tutte polynomial
Sort
View
ISAAC
2003
Springer
133views Algorithms» more  ISAAC 2003»
13 years 10 months ago
The Intractability of Computing the Hamming Distance
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
Bodo Manthey, Rüdiger Reischuk
COCOA
2011
Springer
12 years 5 months ago
Algorithmic Aspects of Heterogeneous Biological Networks Comparison
Biological networks are commonly used to model molecular activity within the cell. Recent experimental studies have shown that the detection of conserved subnetworks across several...
Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-B...