Sciweavers

4759 search results - page 20 / 952
» Parallelizing the Phylogeny Problem
Sort
View
JCB
2008
81views more  JCB 2008»
13 years 7 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...
IPPS
2005
IEEE
14 years 1 months ago
Possibilities to Solve the Clique Problem by Thread Parallelism using Task Pools
We construct parallel algorithms with implementations to solve the clique problem in practice and research their computing time compared with sequential algorithms. The parallel a...
Holger Blaar, Thomas Lange, Renate Winter, Marcel ...
BMCBI
2008
130views more  BMCBI 2008»
13 years 7 months ago
IDEA: Interactive Display for Evolutionary Analyses
Background: The availability of complete genomic sequences for hundreds of organisms promises to make obtaining genome-wide estimates of substitution rates, selective constraints ...
Amy Egan, Anup Mahurkar, Jonathan Crabtree, Jonath...
BMCBI
2007
141views more  BMCBI 2007»
13 years 7 months ago
On the origin and evolution of biosynthetic pathways: integrating microarray data with structure and organization of the Common
Background: The lysine, threonine, and methionine biosynthetic pathways share the three initial enzymatic steps, which are referred to as the Common Pathway (CP). In Escherichia c...
Marco Fondi, Matteo Brilli, Renato Fani
TKDE
2008
153views more  TKDE 2008»
13 years 7 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang