Sciweavers

1199 search results - page 118 / 240
» Robust inference of trees
Sort
View
RECOMB
2009
Springer
15 years 10 months ago
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep
Abstract Constantinos Daskalakis1 , Elchanan Mossel2, , and Sebastien Roch1 1 Microsoft Research 2 UC Berkeley and Weizman Institute We introduce a new phylogenetic reconstruction ...
Constantinos Daskalakis, Elchanan Mossel, Sé...
120
Voted
WSC
2007
15 years 6 months ago
Real-time prediction in a stochastic domain via similarity-based data-mining
This paper introduces an application and a methodology to predict future states of a process under real-time requirements. The real-time functionality is achieved by creating a Ba...
Timo Steffens, Philipp Hügelmeyer
129
Voted
AMAST
2008
Springer
15 years 6 months ago
A Declarative Debugger for Maude
Abstract. Declarative debugging has been applied to many declarative programming paradigms; in this paper, a declarative debugger for rewriting logic specifications, embodied in th...
Adrián Riesco, Alberto Verdejo, Narciso Mar...
JCB
2007
99views more  JCB 2007»
15 years 3 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, ...
137
Voted
AMAI
1999
Springer
15 years 3 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen