default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithms for Molecular Biology, Volume 9
Volume 9, 2014
- Arnon Mazza, Irit Gat-Viks, Hesso Farhan, Roded Sharan:
A minimum-labeling approach for reconstructing protein networks across multiple conditions. 1 - Kamil Salikhov, Gustavo Sacomoto, Gregory Kucherov
:
Using cascading Bloom filters to improve the memory usage for de Brujin graphs. 2 - Michal Nánási, Tomás Vinar, Brona Brejová:
Probabilistic approaches to alignment with tandem repeats. 3 - Fabiano Sviatopolk-Mirsky Pais, Patrícia de Ruy, Guilherme C. Oliveira, Roney Coimbra:
Assessing the efficiency of multiple sequence alignment programs. 4 - Balaji Venkatachalam, Dan Gusfield, Yelena Frid:
Faster algorithms for RNA-folding using the Four-Russians method. 5 - Alice Cleynen, Michel Koskas, Emilie Lebarbier, Guillem Rigaill, Stéphane Robin:
Segmentor3IsBack: an R package for the fast and exact segmentation of Seq-data. 6 - Chun Fang, Tamotsu Noguchi, Hayato Yamana:
Simplified sequence-based method for ATP-binding prediction using contextual local evolutionary conservation. 7 - Ramanuja Simha, Hagit Shatkay:
Protein (multi-)location prediction: using location inter-dependencies in a probabilistic framework. 8 - Carl Barton, Costas S. Iliopoulos, Solon P. Pissis:
Fast algorithms for approximate circular string matching. 9 - Usha Kuppuswamy, Seshan Ananthasubramanian, Yanli Wang, Narayanaswamy Balakrishnan, Madhavi Ganapathiraju:
Predicting gene ontology annotations of orphan GWAS genes using protein-protein interactions. 10 - Limor Leibovich, Zohar Yakhini:
Mutual enrichment in ranked lists and the statistical assessment of position weight matrix motifs. 11 - Michal Modzelewski, Norbert Dojer:
MSARC: Multiple sequence alignment by residue clustering. 12 - Sudheer Vakati, David Fernández-Baca:
Characterizing compatibility and agreement of unrooted trees via cuts in graphs. 13 - Darya Filippova, Rob Patro, Geet Duggal, Carl Kingsford:
Identification of alternative topological domains in chromatin. 14 - Constantinos Tsirogiannis, Brody Sandel:
Computing the skewness of the phylogenetic mean pairwise distance in linear time. 15 - Akshay Deepak, David Fernández-Baca:
Enumerating all maximal frequent subtrees in collections of phylogenetic trees. 16 - Soheila Montaseri, Fatemeh Zare-Mirakabad, Nasrollah Moghadam Charkari:
RNA-RNA interaction prediction using genetic algorithm. 17 - Andrew E. Torda:
Not assessing the efficiency of multiple sequence alignment programs. 18 - Jing Qin, Markus Fricke, Manja Marz, Peter F. Stadler, Rolf Backofen:
Graph-distance distribution of the Boltzmann ensemble of RNA secondary structures. 19 - Anwoy Kumar Mohanty, Aniruddha Datta, Vijayanagaram Venkatraj:
Using the message passing algorithm on discrete data to detect faults in boolean regulatory networks. 20 - Carl Barton, Costas S. Iliopoulos, Solon P. Pissis:
Optimal computation of all tandem repeats in a weighted sequence. 21 - Bernhard Misof, Karen Meusemann, Björn Marcus von Reumont, Patrick Kück, Sonja J. Prohaska, Peter F. Stadler:
A priori assessment of data quality in molecular phylogenetics. 22 - Martin Mann, Feras Nahar, Norah Schnorr, Rolf Backofen, Peter F. Stadler, Christoph Flamm:
Atom mapping with constraint programming. 23 - Sylvain Soliman, François Fages, Ovidiu Radulescu:
A constraint solving approach to model reduction by tropical equilibration. 24 - Mireille Régnier, Evgenia Furletova, Victor Yakovlev, Mikhail A. Roytberg:
Analysis of pattern overlaps and exact computation of P-values of pattern occurrences numbers: case of Hidden Markov Models. 25 - Rui Henriques, Sara C. Madeira:
BicPAM: Pattern-based biclustering for biomedical data analysis. 27 - Sagi Snir:
On the number of genomic pacemakers: a geometric approach. 26
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-28 21:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
