Sciweavers

388 search results - page 15 / 78
» Learning Methods for DNA Binding in Computational Biology
Sort
View
95
Voted
IAJIT
2006
109views more  IAJIT 2006»
15 years 24 days ago
Unconstraint Assignment Problem: A Molecular Computing Approach
: Deoxyribonucleic Acid or DNA-based computing is an emerging field that bridging the gap between chemistry, molecular biology, computer science, and mathematics. This research are...
Zuwairie Ibrahim, Yusei Tsuboi, Osamu Ono, Marzuki...
IFIP
2004
Springer
15 years 6 months ago
Efficient Algorithms for Handling Molecular Weighted Sequences
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
108
Voted
BMCBI
2006
116views more  BMCBI 2006»
15 years 25 days ago
Optimized mixed Markov models for motif identification
Background: Identifying functional elements, such as transcriptional factor binding sites, is a fundamental step in reconstructing gene regulatory networks and remains a challengi...
Weichun Huang, David M. Umbach, Uwe Ohler, Leping ...
99
Voted
BMCBI
2010
128views more  BMCBI 2010»
15 years 27 days ago
Conserved residue clusters at protein-protein interfaces and their use in binding site identification
Background: Biological evolution conserves protein residues that are important for structure and function. Both protein stability and function often require a certain degree of st...
Mainak Guharoy, Pinak Chakrabarti
90
Voted
ALMOB
2008
95views more  ALMOB 2008»
15 years 28 days ago
A stitch in time: Efficient computation of genomic DNA melting bubbles
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
Eivind Tøstesen