Sciweavers

452 search results - page 44 / 91
» Gene finding in novel genomes
Sort
View
BMCBI
2006
99views more  BMCBI 2006»
13 years 8 months ago
Genetic algorithm learning as a robust approach to RNA editing site prediction
Background: RNA editing is one of several post-transcriptional modifications that may contribute to organismal complexity in the face of limited gene complement in a genome. One f...
James Thompson, Shuba Gopal
BMCBI
2007
151views more  BMCBI 2007»
13 years 8 months ago
Minimus: a fast, lightweight genome assembler
Background: Genome assemblers have grown very large and complex in response to the need for algorithms to handle the challenges of large whole-genome sequencing projects. Many of ...
Daniel D. Sommer, Arthur L. Delcher, Steven L. Sal...
WABI
2004
Springer
14 years 1 months ago
Finding Optimal Pairs of Patterns
We consider the problem of finding the optimal pair of string patterns for discriminating between two sets of strings, i.e. finding the pair of patterns that is best with respect...
Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, ...
BMCBI
2008
128views more  BMCBI 2008»
13 years 8 months ago
Finding sequence motifs with Bayesian models incorporating positional information: an application to transcription factor bindin
Background: Biologically active sequence motifs often have positional preferences with respect to a genomic landmark. For example, many known transcription factor binding sites (T...
Nak-Kyeong Kim, Kannan Tharakaraman, Leonardo Mari...
BMCBI
2007
126views more  BMCBI 2007»
13 years 8 months ago
Using gene expression data and network topology to detect substantial pathways, clusters and switches during oxygen deprivation
Background: Biochemical investigations over the last decades have elucidated an increasingly complete image of the cellular metabolism. To derive a systems view for the regulation...
Gunnar Schramm, Marc Zapatka, Roland Eils, Rainer ...