Sciweavers

2192 search results - page 21 / 439
» Algorithms for Challenging Motif Problems
Sort
View
PPL
2007
126views more  PPL 2007»
13 years 7 months ago
Challenges in Parallel Graph Processing
Graph algorithms are becoming increasingly important for solving many problems in scientific computing, data mining and other domains. As these problems grow in scale, parallel c...
Andrew Lumsdaine, Douglas Gregor, Bruce Hendrickso...
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 7 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
SPIRE
2009
Springer
14 years 16 days ago
Faster Algorithms for Sampling and Counting Biological Sequences
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
Christina Boucher
BMCBI
2005
130views more  BMCBI 2005»
13 years 7 months ago
Some statistical properties of regulatory DNA sequences, and their use in predicting regulatory regions in the Drosophila genome
Background: This paper addresses the problem of recognising DNA cis-regulatory modules which are located far from genes. Experimental procedures for this are slow and costly, and ...
Irina I. Abnizova, Rene te Boekhorst, Klaudia Walt...
BMCBI
2006
202views more  BMCBI 2006»
13 years 8 months ago
Integrated biclustering of heterogeneous genome-wide datasets for the inference of global regulatory networks
Background: The learning of global genetic regulatory networks from expression data is a severely under-constrained problem that is aided by reducing the dimensionality of the sea...
David J. Reiss, Nitin S. Baliga, Richard Bonneau