Sciweavers

1199 search results - page 143 / 240
» Robust inference of trees
Sort
View
138
Voted
JCB
2008
81views more  JCB 2008»
15 years 3 months ago
Estimating the Ancestral Recombinations Graph (ARG) as Compatible Networks of SNP Patterns
Traditionally nonrecombinant genome, i.e., mtDNA or Y chromosome, has been used for phylogeography, notably for ease of analysis. The topology of the phylogeny structure in this c...
Laxmi Parida, Marta Melé, Francesc Calafell...
146
Voted
IJUFKS
2000
111views more  IJUFKS 2000»
15 years 3 months ago
A Factorized Representation of Independence of Causal Influence and Lazy Propagation
Theefficiency of algorithmsfor probabilistic inference in Bayesian networks can be improvedby exploiting independenceof causal influence. Thefactorized representation of independe...
Anders L. Madsen, Bruce D'Ambrosio
145
Voted
TIT
1998
123views more  TIT 1998»
15 years 3 months ago
The Minimum Description Length Principle in Coding and Modeling
—We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the...
Andrew R. Barron, Jorma Rissanen, Bin Yu
151
Voted
WABI
2010
Springer
143views Bioinformatics» more  WABI 2010»
15 years 1 months ago
Swiftly Computing Center Strings
The center string (or closest string) problem is a classical computer science problem with important applications in computational biology. Given k input strings and a distance thr...
Franziska Hufsky, Léon Kuchenbecker, Kathar...
161
Voted
PVLDB
2010
128views more  PVLDB 2010»
14 years 10 months ago
Searching Workflows with Hierarchical Views
Workflows are prevalent in diverse applications, which can be scientific experiments, business processes, web services, or recipes. With the dramatically growing number of workflo...
Ziyang Liu, Qihong Shao, Yi Chen