default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithms for Molecular Biology, Volume 6
Volume 6, 2011
- Raffaele Giancarlo, Filippo Utro
:
Speeding up the Consensus Clustering methodology for microarray data analysis. 1 - Michael Hackenberg, Pedro Carpena, Pedro Bernaola-Galván, Guillermo Barturen, Ángel M. Alganza, José L. Oliver:
WordCluster: detecting clusters of DNA words and genomic elements. 2 - Stephan H. Bernhart, Ulrike Mückstein, Ivo L. Hofacker:
RNA Accessibility in cubic time. 3 - Christian Otto, Steve Hoffmann, Jan Gorodkin, Peter F. Stadler:
Fast local fragment chaining using sum-of-pair gap costs. 4 - Alberto Apostolico, Cinzia Pizzi, Esko Ukkonen:
Efficient algorithms for the discovery of gapped factors. 5 - Chen-Ming Hsu, Chien-Yu Chen, Baw-Jhiune Liu:
WildSpan: mining structured motifs from protein sequences. 6 - M. Shel Swenson, Rahul Suri, C. Randal Linder, Tandy J. Warnow:
An experimental study of Quartets MaxCut and other supertree methods. 7 - Duong Dai Doan, Patricia A. Evans:
An FPT haplotyping algorithm on pedigrees with a small number of sites. 8 - Marius Nicolae, Serghei Mangul, Ion I. Mandoiu, Alex Zelikovsky:
Estimation of alternative splicing isoform frequencies from RNA-Seq data. 9 - Bonnie Kirkpatrick:
Haplotypes versus genotypes on pedigrees. 10 - Krister M. Swenson, Ghada Badr, David Sankoff:
Listing all sorting reversals in quadratic time. 11 - Raghavendra Hosur, Rohit Singh, Bonnie Berger:
Sparse estimation for structural variability. 12 - Alexandra M. Carvalho, Arlindo L. Oliveira:
GRISOTTO: A greedy approach to improve combinatorial algorithms for motif discovery with prior knowledge. 13 - Huakun Wang, Zhenzhen Wang, Xia Li, Binsheng Gong, Lixin Feng, Ying Zhou:
A robust approach based on Weibull distribution for clustering gene expression data. 14 - Jesper Buus Nielsen, Anders K. Kristensen, Thomas Mailund, Christian N. S. Pedersen:
A sub-cubic time algorithm for computing the quartet distance between two general trees. 15 - Bill Andreopoulos, Dirk Labudde:
Efficient unfolding pattern recognition in single molecule force spectroscopy data. 16 - Alex Rodionov, Alexandr Bezginov, Jonathan Rose, Elisabeth R. M. Tillier:
A new, fast algorithm for detecting protein coevolution using maximum compatible cliques. 17 - Akdes Serin, Martin Vingron:
DeBi: Discovering Differentially Expressed Biclusters using a Frequent Itemset Approach. 18 - A. K. M. Azad, Saima Shahid, Nasimul Noman, Hyunju Lee:
Prediction of plant promoters based on hexamers and random triplet pair analysis. 19 - Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson:
Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach. 20 - Britta Dorn, Falk Hüffner, Dominikus Krüger, Rolf Niedermeier, Johannes Uhlmann:
Exploiting bounded signal flow for graph orientation based on cause-effect pairs. 21 - Stelios Pavlidis, Annette M. Payne, Stephen Swift:
Multi-membership gene regulation in pathway based microarray analysis. 22 - Vladimir Yanovsky:
ReCoil - an algorithm for compression of extremely large datasets of dna data. 23 - Markus E. Nebel, Anika Scheid, Frank Weinberg:
Random generation of RNA secondary structures according to native distributions. 24 - Valery Polyanovsky, Mikhail A. Roytberg, Vladimir G. Tumanyan:
Comparative analysis of the quality of a global algorithm and a local algorithm for alignment of two sequences. 25 - Ronny Lorenz, Stephan H. Bernhart, Christian Höner zu Siederdissen, Hakim Tafer, Christoph Flamm, Peter F. Stadler, Ivo L. Hofacker:
ViennaRNA Package 2.0. 26 - Tahir Mehmood, Harald Martens, Solve Sæbø, Jonas Warringer, Lars Snipen:
A Partial Least Squares based algorithm for parsimonious variable selection. 27
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-04-09 21:20 CEST 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:
