Sciweavers

4759 search results - page 11 / 952
» Parallelizing the Phylogeny Problem
Sort
View
RECOMB
2000
Springer
13 years 11 months ago
Early eukaryote evolution based on mitochondrial gene order breakpoints
We present a general heuristicfor the median problem for induced breakpoints on genomes with unequal gene content and incorporate this into a routine for estimating optimal gene o...
David Sankoff, David Bryant, Mélanie Deneau...
TCBB
2008
76views more  TCBB 2008»
13 years 7 months ago
Hadamard Conjugation for the Kimura 3ST Model: Combinatorial Proof Using Path Sets
Under a stochastic model of molecular sequence evolution the probability of each possible pattern of characters is well defined. The Kimura's three-substitution-types (K3ST) m...
Michael D. Hendy, Sagi Snir
BMCBI
2006
75views more  BMCBI 2006»
13 years 7 months ago
Improving the specificity of high-throughput ortholog prediction
Background: Orthologs (genes that have diverged after a speciation event) tend to have similar function, and so their prediction has become an important component of comparative g...
Debra L. Fulton, Yvonne Y. Li, Matthew R. Laird, B...
PLDI
2011
ACM
12 years 10 months ago
Parallelism orchestration using DoPE: the degree of parallelism executive
In writing parallel programs, programmers expose parallelism and optimize it to meet a particular performance goal on a single platform under an assumed set of workload characteri...
Arun Raman, Hanjun Kim, Taewook Oh, Jae W. Lee, Da...
RECOMB
2006
Springer
14 years 8 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...