Sciweavers

497 search results - page 26 / 100
» DNA Computing Based on Splicing: Universality Results
Sort
View
ICALP
2009
Springer
14 years 8 months ago
Universal Succinct Representations of Trees?
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
BMCBI
2007
148views more  BMCBI 2007»
13 years 7 months ago
p53FamTaG: a database resource of human p53, p63 and p73 direct target genes combining in silico prediction and microarray data
Background: The p53 gene family consists of the three genes p53, p63 and p73, which have polyhedral non-overlapping functions in pivotal cellular processes such as DNA synthesis a...
Elisabetta Sbisà, Domenico Catalano, Giorgi...
CIBCB
2006
IEEE
14 years 1 months ago
Machine Learning in Basecalling Decoding Trace Peak Behaviour
— DNA sequence basecalling is commonly regarded as a solved problem, despite significant error rates being reflected in inaccuracies in databases and genome annotations. These er...
David Thornley, Stavros Petridis
BMCBI
2010
116views more  BMCBI 2010»
13 years 7 months ago
Predicting success of oligomerized pool engineering (OPEN) for zinc finger target site sequences
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...
Jeffry D. Sander, Deepak Reyon, Morgan L. Maeder, ...
BMCBI
2008
111views more  BMCBI 2008»
13 years 7 months ago
Probabilistic base calling of Solexa sequencing data
Background: Solexa/Illumina short-read ultra-high throughput DNA sequencing technology produces millions of short tags (up to 36 bases) by parallel sequencing-by-synthesis of DNA ...
Jacques Rougemont, Arnaud Amzallag, Christian Isel...