Sciweavers

371 search results - page 28 / 75
» Algorithms for phylogenetic footprinting
Sort
View
APLAS
2009
ACM
14 years 4 months ago
Bi-abductive Resource Invariant Synthesis
We describe an algorithm for synthesizing resource invariants that are used in the verification of concurrent programs. This synthesis employs bi-abductive inference to identify t...
Cristiano Calcagno, Dino Distefano, Viktor Vafeiad...
TALG
2008
67views more  TALG 2008»
13 years 9 months ago
Structure and linear-time recognition of 4-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Andreas Brandstädt, Van Bang Le, R. Sritharan
ICDM
2007
IEEE
157views Data Mining» more  ICDM 2007»
13 years 11 months ago
Training Conditional Random Fields by Periodic Step Size Adaptation for Large-Scale Text Mining
For applications with consecutive incoming training examples, on-line learning has the potential to achieve a likelihood as high as off-line learning without scanning all availabl...
Han-Shen Huang, Yu-Ming Chang, Chun-Nan Hsu
BMCBI
2005
122views more  BMCBI 2005»
13 years 9 months ago
Bayesian coestimation of phylogeny and sequence alignment
Background: Two central problems in computational biology are the determination of the alignment and phylogeny of a set of biological sequences. The traditional approach to this p...
Gerton Lunter, István Miklós, Alexei...
RECOMB
2009
Springer
14 years 4 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é...