341 search results - page 8 / 69 » Paired bondage in trees |
CSB
2004
IEEE
15 years 1 months ago
2004
IEEE
Motivation: Since the whole genome sequences for many species are currently available, computational predictions of RNA secondary structures and computational identifications of t...
49
Voted
APBC
2007
14 years 11 months ago
2007
169
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...
93
Voted
WEA
2010
Springer
15 years 4 months ago
2010
Springer
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
ACL
2012
13 years 1 days ago
2012
Learning for sentence re-writing is a fundamental task in natural language processing and information retrieval. In this paper, we propose a new class of kernel functions, referre...