Sciweavers

7596 search results - page 1364 / 1520
» Challenges in forensic computing
Sort
View
BMCBI
2010
108views more  BMCBI 2010»
15 years 4 months ago
An intuitionistic approach to scoring DNA sequences against transcription factor binding site motifs
Background: Transcription factors (TFs) control transcription by binding to specific regions of DNA called transcription factor binding sites (TFBSs). The identification of TFBSs ...
Fernando Garcia-Alcalde, Armando Blanco, Adrian J....
BMCBI
2008
130views more  BMCBI 2008»
15 years 4 months ago
An enhanced partial order curve comparison algorithm and its application to analyzing protein folding trajectories
Background: Understanding how proteins fold is essential to our quest in discovering how life works at the molecular level. Current computation power enables researchers to produc...
Hong Sun, Hakan Ferhatosmanoglu, Motonori Ota, Yus...
BMCBI
2007
151views more  BMCBI 2007»
15 years 4 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...
BMCBI
2008
102views more  BMCBI 2008»
15 years 4 months ago
Fast splice site detection using information content and feature reduction
Background: Accurate identification of splice sites in DNA sequences plays a key role in the prediction of gene structure in eukaryotes. Already many computational methods have be...
A. K. M. A. Baten, Saman K. Halgamuge, Bill C. H. ...
CACM
2008
101views more  CACM 2008»
15 years 4 months ago
Just say 'A Class Defines a Data Type'
data type and (Java) class, asking about the relationship between them. The same students would also be unlikely to find an answer in a CS1 textbook. Some textbooks might not even ...
Chenglie Hu
« Prev « First page 1364 / 1520 Last » Next »