666 search results - page 57 / 134 » New primal-dual algorithms for Steiner tree problems |
CPM
1999
Springer
14 years 1 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
BMCBI
2006
13 years 9 months ago
2006
Background: The problem of inferring the evolutionary history and constructing the phylogenetic tree with high performance has become one of the major problems in computational bi...
ICML
2004
IEEE
14 years 10 months ago
2004
IEEE
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
KDD
2002
ACM
14 years 9 months ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
AMAI
2004
Springer
14 years 2 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...