Sciweavers

451 search results - page 33 / 91
» SAT-based protein design
Sort
View
ICCAD
2009
IEEE
159views Hardware» more  ICCAD 2009»
13 years 5 months ago
First steps towards SAT-based formal analog verification
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
Saurabh K. Tiwary, Anubhav Gupta, Joel R. Phillips...
CPM
2006
Springer
125views Combinatorics» more  CPM 2006»
13 years 11 months ago
Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...
Tetsuo Shibuya
BMCBI
2007
129views more  BMCBI 2007»
13 years 7 months ago
Exploring inconsistencies in genome-wide protein function annotations: a machine learning approach
Background: Incorrectly annotated sequence data are becoming more commonplace as databases increasingly rely on automated techniques for annotation. Hence, there is an urgent need...
Carson M. Andorf, Drena Dobbs, Vasant Honavar
BMCBI
2008
124views more  BMCBI 2008»
13 years 7 months ago
RPPAML/RIMS: A metadata format and an information management system for reverse phase protein arrays
Background: Reverse Phase Protein Arrays (RPPA) are convenient assay platforms to investigate the presence of biomarkers in tissue lysates. As with other high-throughput technolog...
Romesh Stanislaus, Mark Carey, Helena F. Deus, Kev...
BMCBI
2008
123views more  BMCBI 2008»
13 years 7 months ago
A tree-based conservation scoring method for short linear motifs in multiple alignments of protein sequences
Background: The structure of many eukaryotic cell regulatory proteins is highly modular. They are assembled from globular domains, segments of natively disordered polypeptides and...
Claudia Chica, Alberto Labarga, Cathryn M. Gould, ...