Sciweavers

4137 search results - page 322 / 828
» On the number of matchings of a tree
Sort
View
JCB
2007
99views more  JCB 2007»
15 years 6 months ago
Duplication and Inversion History of a Tandemly Repeated Genes Family
Given a phylogenetic tree for a family of tandemly repeated genes and their signed order on the chromosome, we aim to find the minimum number of inversions compatible with an evo...
Mathieu Lajoie, Denis Bertrand, Nadia El-Mabrouk, ...
JSYML
2010
95views more  JSYML 2010»
15 years 1 months ago
Some natural decision problems in automatic graphs
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
Dietrich Kuske, Markus Lohrey
JMLR
2010
117views more  JMLR 2010»
15 years 1 months ago
Exploiting the High Predictive Power of Multi-class Subgroups
Subgroup discovery aims at finding subsets of a population whose class distribution is significantly different from the overall distribution. A number of multi-class subgroup disc...
Tarek Abudawood, Peter A. Flach
CORR
2008
Springer
156views Education» more  CORR 2008»
15 years 7 months ago
Pairing Functions, Boolean Evaluation and Binary Decision Diagrams
A "pairing function" J associates a unique natural number z to any two natural numbers x,y such that for two "unpairing functions" K and L, the equalities K(J(x...
Paul Tarau
RECOMB
2006
Springer
16 years 7 months ago
A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
Nicholas D. Pattengale, Bernard M. E. Moret