Sciweavers

186 search results - page 35 / 38
» A new approach to fragment assembly in DNA sequencing
Sort
View
IJFCS
2006
130views more  IJFCS 2006»
13 years 6 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
BMCBI
2007
106views more  BMCBI 2007»
13 years 6 months ago
Modeling SAGE tag formation and its effects on data interpretation within a Bayesian framework
Background: Serial Analysis of Gene Expression (SAGE) is a high-throughput method for inferring mRNA expression levels from the experimentally generated sequence based tags. Stand...
Michael A. Gilchrist, Hong Qin, Russell L. Zaretzk...
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
13 years 10 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
BMCBI
2007
181views more  BMCBI 2007»
13 years 6 months ago
ASMPKS: an analysis system for modular polyketide synthases
Background: Polyketides are secondary metabolites of microorganisms with diverse biological activities, including pharmacological functions such as antibiotic, antitumor and agroc...
Hongseok Tae, Eun-Bae Kong, Kiejung Park
BMCBI
2007
145views more  BMCBI 2007»
13 years 6 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...