1057 search results - page 31 / 212 » Theoretical and Experimental DNA Computation |
BMCBI
2010
13 years 11 months ago
2010
Background: Precise and efficient methods for gene targeting are critical for detailed functional analysis of genomes and regulatory networks and for potentially improving the eff...
SOFSEM
2012
Springer
12 years 6 months ago
2012
Springer
Abstract. Iterated hairpin completion is an operation on formal languages that is inspired by the hairpin formation in DNA biochemistry. Iterated hairpin completion of a word (or m...
ICCS
2009
Springer
14 years 5 months ago
2009
Springer
Many bioinformatics studies require the analysis of RNA or DNA structures. More specifically, extensive work is done to elaborate efficient algorithms able to predict the 2-D fold...
RECOMB
2005
Springer
14 years 11 months ago
2005
Springer
Transcriptional regulation is accomplished by several transcription factor proteins that bind to specific DNA elements in the relative vicinity of the gene, and interact with each ...
IPPS
2006
IEEE
14 years 4 months ago
2006
IEEE
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...