Sciweavers

2877 search results - page 207 / 576
» Biological Computing
Sort
View
127
Voted
RECOMB
2005
Springer
16 years 3 months ago
Stability of Rearrangement Measures in the Comparison of Genome Sequences
We present data-analytic and statistical tools for studying rates of rearrangement of whole genomes and to assess the stability of these methods with changes in the level of resol...
David Sankoff, Matthew Mazowita
RECOMB
2001
Springer
16 years 3 months ago
Fast recovery of evolutionary trees with thousands of nodes
We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working...
Miklós Csürös
AB
2008
Springer
15 years 5 months ago
The Geometry of the Neighbor-Joining Algorithm for Small Trees
In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstr...
Kord Eickmeyer, Ruriko Yoshida
ASM
2008
ASM
15 years 5 months ago
The Composition of Event-B Models
The transition from classical B [2] to the Event-B language and method [3] has seen the removal of some forms of model structuring and composition, with the intention of reinventin...
Michael Poppleton
ISMB
1998
15 years 4 months ago
Identification of Divergent Functions in Homologous Proteins by Induction over Conserved Modules
Homologousproteins do not necessarily exhibit identical biochemicalfunction. Despitethis fact, local or global sequence similarity is widely used as an indication of functional id...
Imran Shah, Lawrence Hunter