default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2. WABI 2002: Rome, Italy
- Roderic Guigó, Dan Gusfield:
Algorithms in Bioinformatics, Second International Workshop, WABI 2002, Rome, Italy, September 17-21, 2002, Proceedings. Lecture Notes in Computer Science 2452, Springer 2002, ISBN 3-540-44211-1 - L. R. Grate, Chiranjib Bhattacharyya, Michael I. Jordan, I. Saira Mian:
Simultaneous Relevant Feature Identification and Classification in High-Dimensional Spaces. 1-9 - Miklós Csürös, Aleksandar Milosavljevic:
Pooled Genomic Indexing (PGI): Mathematical Analysis and Experiment Design. 10-28 - Romeo Rizzi, Vineet Bafna
, Sorin Istrail, Giuseppe Lancia:
Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem. 29-43 - Russell Schwartz, Andrew G. Clark, Sorin Istrail:
Methods for Inferring Block-Wise Ancestral History from Haploid Sequences. 44-59 - Martin Reczko, Petko Fiziev, Eike Staub, Artemis G. Hatzigeorgiou:
Finding Signal Peptides in Human Protein Sequences Using Recurrent Neural Networks. 60-67 - Nathan Edwards, Ross Lippert:
Generating Peptide Candidates from Amino-Acid Sequence Databases for Protein Identification via Mass Spectrometry. 68-81 - Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin, Jianjun Wen, Dong Xu, Ying Xu:
Improved Approximation Algorithms for NMR Spectral Peak Assignment. 82-96 - Louxin Zhang, Bin Ma, Lusheng Wang:
Efficient Methods for Inferring Tandem Duplication History. 97-111 - Li-San Wang:
Genome Rearrangement Phylogeny Using Weighbor. 112-125 - Aaron L. Halpern, Daniel H. Huson, Knut Reinert:
Segment Match Refinement and Applications. 126-139 - Ezekiel F. Adebiyi, Michael Kaufmann:
Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation. 140-156 - Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu:
Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics. 157-171 - Mariusz Milik, Sándor Szalma, Krzysztof A. Olszewski:
FAUST: An Algorithm for Extracting Functionally Relevant Templates from Protein Structures. 172-184 - Dina Duhovny, Ruth Nussinov, Haim J. Wolfson:
Efficient Unbound Docking of Rigid Molecules. 185-200 - Raymond Wheeler:
A Method of Consolidating and Combining EST and mRNA Alignments to a Genome to Enumerate Supported Splice Variants. 201-209 - Mihaela Pertea, Steven Salzberg:
A Method to Improve the Performance of Translation Start Site Detection and Its Application for Gene Finding. 210-219 - Christian N. S. Pedersen, Tejs Scharling:
Comparative Methods for Gene Structure Prediction in Homologous Sequences. 220-234 - Maxim Shatsky, Ruth Nussinov, Haim J. Wolfson:
MultiProt - A Multiple Protein Structural Alignment Algorithm. 235-250 - Emily Rocke:
A Hybrid Scoring Function for Protein Multiple Alignment. 251-262 - Yonatan Bilu, Michal Linial:
Functional Consequences in Metabolic Pathways from Phylogenetic Profiles. 263-276 - Esko Ukkonen:
Finding Founder Sequences from a Set of Recombinants. 277-286 - Luay Nakhleh, Usman Roshan, Lisa Vawter, Tandy J. Warnow:
Estimating the Deviation from a Molecular Clock. 287-299 - Yasmine Ajana, Jean-François Lefebvre, Elisabeth R. M. Tillier, Nadia El-Mabrouk:
Exploring the Set of All Minimal Sequences of Reversals - An Application to Test the Replication-Directed Reversal Hypothesis. 300-315 - Niklas Eriksen:
Approximating the Expected Number of Inversions Given the Number of Breakpoints. 316-330 - Gene Myers, Richard Durbin:
Invited Lecture - Accelerating Smith-Waterman Searches. 331-342 - Bernard M. E. Moret, Usman Roshan, Tandy J. Warnow:
Sequence-Length Requirements for Phylogenetic Methods. 343-356 - Richard Desper, Olivier Gascuel:
Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle. 357-374 - David Bryant, Vincent Moulton:
NeighborNet: An Agglomerative Method for the Construction of Planar Phylogenetic Networks. 375-391 - Hon Wai Leong, Franco P. Preparata, Wing-Kin Sung, Hugo Willy:
On the Control of Hybridization Noise in DNA Sequencing-by-Hybridization. 392-403 - Steven Skiena, Sagi Snir:
Restricting SBH Ambiguity via Restriction Enzymes. 404-417 - Ehud Shapiro:
Invited Lecture - Molecule as Computation: Towards an Abstraction of Biomolecular Systems. 418 - Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder:
Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. 419-433 - Sven Rahmann:
Rapid Large-Scale Oligonucleotide Selection for Microarrays. 434 - Andrew B. Kahng, Ion I. Mandoiu, Pavel A. Pevzner, Sherief Reda, Alexander Zelikovsky:
Border Length Minimization in DNA Array Design. 435-448 - Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch:
The Enhanced Suffix Array and Its Applications to Genome Analysis. 449-463 - Anne Bergeron, Sylvie Corteel, Mathieu Raffinot:
The Algorithmic of Gene Teams. 464-476 - Liling L. Warren, Ben Hui Liu:
Combinatorial Use of Short Probes for Differential Gene Expression Profiling. 477-490 - Doron Lipson, Peter Webb, Zohar Yakhini:
Designing Specific Oligonucleotide Probes for the Entire S. cerevisiae Transcriptome. 491-505 - Ziv Bar-Joseph, Erik D. Demaine, David K. Gifford, Angèle M. Hamel, Tommi S. Jaakkola, Nathan Srebro:
K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data. 506-520 - Bernard M. E. Moret, Adam C. Siepel, Jijun Tang, Tao Liu:
Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data. 521-536 - Roderic D. M. Page:
Modified Mincut Supertrees. 537-552
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 2026-05-27 02:05 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:
