Sciweavers

19700 search results - page 3931 / 3940
» DNA-Based Computation Times
Sort
View
JALC
2007
90views more  JALC 2007»
13 years 7 months ago
Learning Unary Automata
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
Gregor Gramlich, Ralf Herrmann
BMCBI
2005
116views more  BMCBI 2005»
13 years 7 months ago
WEBnm@: a web application for normal mode analyses of proteins
Background: Normal mode analysis (NMA) has become the method of choice to investigate the slowest motions in macromolecular systems. NMA is especially useful for large biomolecula...
Siv Midtun Hollup, Gisle Sælensminde, Nathal...
BMCBI
2005
117views more  BMCBI 2005»
13 years 7 months ago
An SVM-based system for predicting protein subnuclear localizations
Background: The large gap between the number of protein sequences in databases and the number of functionally characterized proteins calls for the development of a fast computatio...
Zhengdeng Lei, Yang Dai
BMCBI
2005
107views more  BMCBI 2005»
13 years 7 months ago
An edit script for taxonomic classifications
Abstract. Taxonomy provides one of the most powerful ways to navigate sequence data bases but currently, users are forced to formulate queries according to a single taxonomic class...
Roderic D. M. Page, Gabriel Valiente
BMCBI
2005
106views more  BMCBI 2005»
13 years 7 months ago
SIMPROT: Using an empirically determined indel distribution in simulations of protein evolution
Background: General protein evolution models help determine the baseline expectations for the evolution of sequences, and they have been extensively useful in sequence analysis an...
Andy Pang, Andrew D. Smith, Paulo A. S. Nuin, Elis...
« Prev « First page 3931 / 3940 Last » Next »