Sciweavers

351 search results - page 48 / 71
» Fast Motif Search in Protein Sequence Databases
Sort
View
BMCBI
2008
208views more  BMCBI 2008»
14 years 12 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
BMCBI
2006
133views more  BMCBI 2006»
14 years 11 months ago
Choosing negative examples for the prediction of protein-protein interactions
The protein-protein interaction networks of even well-studied model organisms are sketchy at best, highlighting the continued need for computational methods to help direct experim...
Asa Ben-Hur, William Stafford Noble
BMCBI
2008
142views more  BMCBI 2008»
14 years 12 months ago
Optimal neighborhood indexing for protein similarity search
Background: Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data ...
Pierre Peterlongo, Laurent Noé, Dominique L...
IPPS
2003
IEEE
15 years 5 months ago
A Fast Algorithm for the Exhaustive Analysis of 12-Nucleotide-Long DNA Sequences. Applications to Human Genomics
We have developed a new algorithm that allows the exhaustive determination of words of up to 12 nucleotides in DNA sequences. It is fast enough as to be used at a genomic scale ru...
Vicente Arnau, Ignacio Marín
ICCAD
2009
IEEE
147views Hardware» more  ICCAD 2009»
14 years 9 months ago
SAT-based protein design
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
Noah Ollikainen, Ellen Sentovich, Carlos Coelho, A...