DNA binding sites: representation and discovery
GD Stormo - Bioinformatics, 2000 - academic.oup.com
The purpose of this article is to provide a brief history of the development and application of
computer algorithms for the analysis and prediction of DNA binding sites. This problem can …
computer algorithms for the analysis and prediction of DNA binding sites. This problem can …
Antimicrobial peptides: an overview of a promising class of therapeutics
A Giuliani, G Pirri, S Nicoletto - Open Life Sciences, 2007 - degruyter.com
Antibiotic resistance is increasing at a rate that far exceeds the pace of new development of
drugs. Antimicrobial peptides, both synthetic and from natural sources, have raised interest …
drugs. Antimicrobial peptides, both synthetic and from natural sources, have raised interest …
[BOOK][B] Data mining with decision trees: theory and applications
Decision trees have become one of the most powerful and popular approaches in
knowledge discovery and data mining; it is the science of exploring large and complex …
knowledge discovery and data mining; it is the science of exploring large and complex …
[BOOK][B] Handbook of constraint programming
Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …
that draws on a wide range of techniques from artificial intelligence, computer science …
A pattern-based method for the identification of MicroRNA binding sites and their corresponding heteroduplexes
We present rna22, a method for identifying microRNA binding sites and their corresponding
heteroduplexes. Rna22 does not rely upon cross-species conservation, is resilient to noise …
heteroduplexes. Rna22 does not rely upon cross-species conservation, is resilient to noise …
COBALT: constraint-based alignment tool for multiple protein sequences
JS Papadopoulos, R Agarwala - Bioinformatics, 2007 - academic.oup.com
Motivation: A tool that simultaneously aligns multiple protein sequences, automatically
utilizes information about protein domains, and has a good compromise between speed and …
utilizes information about protein domains, and has a good compromise between speed and …
An iterative statistical approach to the identification of protein phosphorylation motifs from large-scale data sets
With the recent exponential increase in protein phosphorylation sites identified by mass
spectrometry, a unique opportunity has arisen to understand the motifs surrounding such …
spectrometry, a unique opportunity has arisen to understand the motifs surrounding such …
Mafia: A maximal frequent itemset algorithm for transactional databases
We present a new algorithm for mining maximal frequent itemsets from a transactional
database. Our algorithm is especially efficient when the itemsets in the database are very …
database. Our algorithm is especially efficient when the itemsets in the database are very …
Non-classical protein secretion in bacteria
Background We present an overview of bacterial non-classical secretion and a prediction
method for identification of proteins following signal peptide independent secretion …
method for identification of proteins following signal peptide independent secretion …
Probabilistic discovery of time series motifs
Several important time series data mining problems reduce to the core task of finding
approximately repeated subsequences in a longer time series. In an earlier work, we …
approximately repeated subsequences in a longer time series. In an earlier work, we …