default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 36 matches
- 2005
- Pankaj K. Agarwal, Yonatan Bilu, Rachel Kolodny:
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons. WABI 2005: 315-327 - Markus Bauer, Gunnar W. Klau, Knut Reinert:
Multiple Structural RNA Alignment with Lagrangian Relaxation. WABI 2005: 303-314 - Sèverine Bérard, Anne Bergeron, Cédric Chauve, Christophe Paul:
Perfect Sorting by Reversals Is Not Always Difficult. WABI 2005: 228-238 - Robert S. Boyer, Warren A. Hunt Jr., Serita M. Nelesen:
A Compressed Format for Collections of Phylogenetic Trees and Improved Consensus Performance. WABI 2005: 353-364 - Laurent Bréhélin:
Clustering Gene Expression Series with Prior Knowledge. WABI 2005: 27-38 - Chris Christiansen, Thomas Mailund, Christian N. S. Pedersen, Martin Randers:
Computing the Quartet Distance Between Trees of Arbitrary Degree. WABI 2005: 77-88 - Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John Tromp:
On the Complexity of Several Haplotyping Problems. WABI 2005: 128-139 - Daniel Dalevi, Devdatt P. Dubhashi:
The Peres-Shields Order Estimator for Fixed and Variable Length Markov Models with Applications to DNA Sequence Similarity. WABI 2005: 291-302 - Isaac Elias, Tzvika Hartman:
A 1.375-Approximation Algorithm for Sorting by Transpositions. WABI 2005: 204-215 - Eran Eyal, Dan Halperin:
Improved Maintenance of Molecular Surfaces Using Dynamic Graph Connectivity. WABI 2005: 401-413 - Ganeshkumar Ganapathy, Barbara Goodson, Robert K. Jansen, Vijaya Ramachandran, Tandy J. Warnow:
Pattern Identification in Biogeography. WABI 2005: 116-127 - Alexander Kister:
The Main Structural Regularities of the Sandwich Proteins. WABI 2005: 414-422 - Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg:
A Unifying Framework for Seed Sensitivity and Its Application to Subset Seeds. WABI 2005: 251-263 - Anthony Labarre:
A New Tight Upper Bound on the Transposition Distance. WABI 2005: 216-227 - Vincent Lacroix, Cristina G. Fernandes, Marie-France Sagot:
Reaction Motifs in Metabolic Networks. WABI 2005: 178-191 - Keren Lasker, Oranit Dror, Ruth Nussinov, Haim J. Wolfson:
Discovery of Protein Substructures in EM Maps. WABI 2005: 423-434 - Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink:
Rotamer-Pair Energy Calculations Using a Trie Data Structure. WABI 2005: 389-400 - Henry C. M. Leung, Francis Y. L. Chin:
Generalized Planted (l, d)-Motif Problem with Negative Set. WABI 2005: 264-275 - Rune B. Lyngsø, Yun S. Song, Jotun Hein:
Minimum Recombination Histories by Branch and Bound. WABI 2005: 239-250 - Sara C. Madeira, Arlindo L. Oliveira:
A Linear Time Biclustering Algorithm for Time Series Gene Expression Data. WABI 2005: 39-52 - Shlomo Moran, Satish Rao, Sagi Snir:
Using Semi-definite Programming to Enhance Supertree Resolvability. WABI 2005: 89-103 - Zeshan Peng, H. F. Ting:
An Efficient Reduction from Constrained to Unconstrained Maximum Agreement Subtree. WABI 2005: 104-115 - Pasi Rastas, Mikko Koivisto, Heikki Mannila, Esko Ukkonen:
A Hidden Markov Technique for Haplotype Reconstruction. WABI 2005: 140-151 - Baharak Rastegari, Anne Condon:
Linear Time Algorithm for Parsing RNA Secondary Structure. WABI 2005: 341-352 - Michael Sammeth, Thomas Weniger, Dag Harmsen, Jens Stoye:
Alignment of Tandem Repeats with Excision, Duplication, Substitution and Indels (EDSI). WABI 2005: 276-290 - Yinglei Song, Chunmei Liu, Xiuzhen Huang, Russell L. Malmberg, Ying Xu, Liming Cai:
Efficient Parameterized Algorithm for Biopolymer Structure-Sequence Alignment. WABI 2005: 376-388 - Yun S. Song, Yufeng Wu, Dan Gusfield:
Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event. WABI 2005: 152-164 - Nora Speer, Christian Spieth, Andreas Zell:
Spectral Clustering Gene Ontology Terms to Group Genes by Function. WABI 2005: 1-12 - Warwick Tucker, Vincent Moulton:
Reconstructing Metabolic Networks Using Interval Analysis. WABI 2005: 192-203 - Tamir Tuller, Efrat Oron, Erez Makavy, Daniel A. Chamovitz, Benny Chor:
Time-Window Analysis of Developmental Gene Expression Data with Multiple Genetic Backgrounds. WABI 2005: 53-64
skipping 6 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-23 19:05 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint