Sciweavers

621 search results - page 62 / 125
» DNA Computing in Microreactors
Sort
View
IPPS
2006
IEEE
14 years 2 months ago
Phylogenetic models of rate heterogeneity: a high performance computing perspective
Inference of phylogenetic trees using the maximum likelihood (ML) method is NP-hard. Furthermore, the computation of the likelihood function for huge trees of more than 1,000 orga...
Alexandros Stamatakis
SC
2005
ACM
14 years 1 months ago
Scheduling speculative tasks in a compute farm
Users often behave speculatively, submitting work that initially they do not know is needed. Farm computing often consists of single node speculative tasks issued by, e.g., bioinf...
David Petrou, Garth A. Gibson, Gregory R. Ganger
IJFCS
2006
91views more  IJFCS 2006»
13 years 8 months ago
Bit-parallel Computation of Local Similarity Score Matrices with Unitary Weights
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...
Heikki Hyyrö, Gonzalo Navarro
WOB
2003
140views Bioinformatics» more  WOB 2003»
13 years 9 months ago
Computing Maximum Subsequence in Parallel
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
Carlos E. R. Alves, Edson Cáceres, Siang W....
BMCBI
2002
128views more  BMCBI 2002»
13 years 8 months ago
Correlating overrepresented upstream motifs to gene expression: a computational approach to regulatory element discovery in euka
Background: Gene regulation in eukaryotes is mainly effected through transcription factors binding to rather short recognition motifs generally located upstream of the coding regi...
Michele Caselle, Ferdinando Di Cunto, Paolo Prover...