Sciweavers

1199 search results - page 19 / 240
» Robust inference of trees
Sort
View
JAR
2007
72views more  JAR 2007»
13 years 10 months ago
Inferring Phylogenetic Trees Using Answer Set Programming
We describe the reconstruction of a phylogeny for a set of taxa, with a character-based cladistics approach, in a declarative knowledge representation formalism, and show how to u...
Daniel R. Brooks, Esra Erdem, Selim T. Erdogan, Ja...
NIPS
2003
13 years 11 months ago
Sample Propagation
Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where conditioning o...
Mark A. Paskin
ASIAN
1998
Springer
133views Algorithms» more  ASIAN 1998»
14 years 2 months ago
Type Inference for First-Class Messages with Feature Constraints
Abstract. We present a constraint system OF of feature trees that is appropriate to specify and implement type inference for first-class messages. OF extends traditional systems of...
Martin Müller, Susumu Nishimura
IANDC
2011
148views more  IANDC 2011»
13 years 5 months ago
Building species trees from larger parts of phylogenomic databases
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
ICDCS
2006
IEEE
14 years 4 months ago
Overlay Multicast with Inferred Link Capacity Correlations
We model the overlay using linear capacity constraints, which accurately and succinctly capture overlay link correlations. We show that finding a maximum-bandwidth multicast tree...
Ying Zhu, Baochun Li