Остановите войну!
for scientists:
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 33 matches
- 2008
- Rumen Andonov, Nicola Yanev, Noël Malod-Dognin:
An Efficient Lagrangian Relaxation for the Contact Map Overlap Problem. WABI 2008: 162-173 - Florian Battke, Carsten Müller-Tidow, Hubert Serve, Kay Nieselt:
Post-Hybridization Quality Measures for Oligos in Genome-Wide Microarray Experiments. WABI 2008: 64-75 - Hans-Joachim Böckenhauer, Abu Zafer M. Dayem Ullah, Leonidas Kapsokalivas, Kathleen Steinhöfel:
A Local Move Set for Protein Folding in Triangular Lattice Models. WABI 2008: 369-381 - Serdar Bozdag, Timothy J. Close, Stefano Lonardi:
Computing the Minimal Tiling Path from a Physical Map by Integer Linear Programming. WABI 2008: 148-161 - Arthur Choi, Noah Zaitlen, Buhm Han, Knot Pipatsrisawat, Adnan Darwiche, Eleazar Eskin:
Efficient Genome Wide Tagging by Reduction to SAT. WABI 2008: 135-147 - Ludovic Cottret, Paulo Vieira Milreu, Vicente Acuña, Alberto Marchetti-Spaccamela, Fábio Viduani Martinez, Marie-France Sagot, Leen Stougie:
Enumerating Precursor Sets of Target Metabolites in a Metabolic Network. WABI 2008: 233-244 - Peter Damaschke:
Minimum Common String Partition Parameterized. WABI 2008: 87-98 - Stefan Grünewald, Andreas Spillner, Kristoffer Forslund, Vincent Moulton:
Constructing Phylogenetic Supernetworks from Quartets. WABI 2008: 284-295 - Inke Herms, Sven Rahmann:
Computing Alignment Seed Sensitivity with Probabilistic Arithmetic Automata. WABI 2008: 318-329 - Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh:
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. WABI 2008: 76-86 - Daniel H. Huson, Regula Rupp:
Summarizing Multiple Gene Trees Using Cluster Networks. WABI 2008: 296-305 - Vincent Lacroix, Michael Sammeth, Roderic Guigó, Anne Bergeron:
Exact Transcriptome Reconstruction from Short Sequence Reads. WABI 2008: 50-63 - Thomas Lingner, Peter Meinicke:
Fast Target Set Reduction for Large-Scale Protein Function Prediction: A Multi-class Multi-label Machine Learning Approach. WABI 2008: 198-209 - Alexander Medvedovsky, Vineet Bafna, Uri Zwick, Roded Sharan:
An Algorithm for Orienting Graphs Based on Cause-Effect Pairs and Its Applications to Orienting Protein Networks. WABI 2008: 222-232 - Zoran Nikoloski, Sergio Grimbs, Joachim Selbig, Oliver Ebenhöh:
Hardness and Approximability of the Inverse Scope Problem. WABI 2008: 99-112 - Cheng Soon Ong, Alexander Zien:
An Automated Combination of Kernels for Predicting Protein Subcellular Localization. WABI 2008: 186-197 - Martin Paluszewski, Pawel Winter:
Protein Decoy Generation Using Branch and Bound with Efficient Bounding. WABI 2008: 382-393 - Nico Pfeifer, Oliver Kohlbacher:
Multiple Instance Learning Allows MHC Class II Epitope Predictions Across Alleles. WABI 2008: 210-221 - José Augusto Amgarten Quitzau, Jens Stoye:
Detecting Repeat Families in Incompletely Sequenced Genomes. WABI 2008: 342-353 - Pasi Rastas, Jussi Kollin, Mikko Koivisto:
Fast Bayesian Haplotype Inference Via Context Tree Weighting. WABI 2008: 259-270 - Raheleh Salari, Alexander Schönhuth, Fereydoun Hormozdiari, Artem Cherkasov, Süleyman Cenk Sahinalp:
The Relation between Indel Length and Functional Divergence: A Formal Study. WABI 2008: 330-341 - Marcel H. Schulz, David Weese, Tobias Rausch, Andreas Döring, Knut Reinert, Martin Vingron:
Fast and Adaptive Variable Order Markov Chain Construction. WABI 2008: 306-317 - Martin Simonsen, Thomas Mailund, Christian N. S. Pedersen:
Rapid Neighbour-Joining. WABI 2008: 113-122 - Sagi Snir, Tamir Tuller:
Novel Phylogenetic Network Inference by Combining Maximum Likelihood and Hidden Markov Models. WABI 2008: 354-368 - Seung-Jin Sul, Grant R. Brammer, Tiffani L. Williams:
Efficiently Computing Arbitrarily-Sized Robinson-Foulds Distance Matrices. WABI 2008: 123-134 - Eric Tannier, Chunfang Zheng, David Sankoff:
Multichromosomal Genome Median and Halving Problems. WABI 2008: 1-13 - Andrew Wei Xu, David Sankoff:
Decompositions of Multiple Breakpoint Graphs and Rapid Exact Solutions to the Median Problem. WABI 2008: 25-37 - Vladimir Yanovski, Stephen M. Rumble, Michael Brudno:
Read Mapping Algorithms for Single Molecule Sequencing Data. WABI 2008: 38-49 - Meng Zhang, William Arndt, Jijun Tang:
A Branch-and-Bound Method for the Multichromosomal Reversal Median Problem. WABI 2008: 14-24 - Xiuwei Zhang, Bernard M. E. Moret:
Boosting the Performance of Inference Algorithms for Transcriptional Regulatory Networks Using a Phylogenetic Approach. WABI 2008: 245-258
skipping 3 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-04-19 03:10 CEST 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