Sciweavers

1686 search results - page 335 / 338
» Programs as polygraphs: computability and complexity
Sort
View
BIOCOMP
2007
13 years 9 months ago
Prediction of trans-antisense Transcripts in Arabidopsis thaliana
Background: Natural antisense transcripts (NATs) are coding or non-coding RNAs with sequence complementarity to other transcripts (sense transcripts). These RNAs could potentially...
Huan Wang, Nam-Hai Chua, Xiu-Jie Wang
CIDR
2003
106views Algorithms» more  CIDR 2003»
13 years 8 months ago
Speculative Query Processing
Speculation is an every day phenomenon whereby one acts in anticipation of particular conditions that are likely to hold in the future. Computer science research has seen many suc...
Neoklis Polyzotis, Yannis E. Ioannidis
BMCBI
2007
100views more  BMCBI 2007»
13 years 7 months ago
SBMLeditor: effective creation of models in the Systems Biology Markup Language (SBML)
Background: The need to build a tool to facilitate the quick creation and editing of models encoded in the Systems Biology Markup language (SBML) has been growing with the number ...
Nicolas Rodriguez, Marco Donizelli, Nicolas Le Nov...
BMCBI
2007
108views more  BMCBI 2007»
13 years 7 months ago
Computer-aided identification of polymorphism sets diagnostic for groups of bacterial and viral genetic variants
Background: Single nucleotide polymorphisms (SNPs) and genes that exhibit presence/absence variation have provided informative marker sets for bacterial and viral genotyping. Iden...
Erin P. Price, John Inman-Bamber, Venugopal Thiruv...
BMCBI
2008
211views more  BMCBI 2008»
13 years 7 months ago
CPSP-tools - Exact and complete algorithms for high-throughput 3D lattice protein studies
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
Martin Mann, Sebastian Will, Rolf Backofen