Остановите войну!
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 45 matches
- 2003
- Tatsuya Akutsu:
Efficient extraction of mapping rules of atoms from enzymatic reaction data. RECOMB 2003: 1-8 - Vineet Bafna, Nathan Edwards:
On de novo interpretation of tandem mass spectra for peptide identification. RECOMB 2003: 9-18 - Vineet Bafna, Bjarni V. Halldórsson, Russell Schwartz, Andrew G. Clark, Sorin Istrail:
Haplotypes and informative SNP selection algorithms: don't block out information. RECOMB 2003: 19-27 - Yoseph Barash, Gal Elidan, Nir Friedman, Tommy Kaplan:
Modeling dependencies in protein-DNA binding sites. RECOMB 2003: 28-37 - Gill Bejerano:
Efficient exact value computation and applications to biosequence analysis. RECOMB 2003: 38-47 - Amir Ben-Dor, Tzvika Hartman, Benno Schwikowski, Roded Sharan, Zohar Yakhini:
Towards optimally multiplexed applications of universal DNA tag systems. RECOMB 2003: 48-56 - Mathieu Blanchette:
A comparative analysis method for detecting binding sites in coding regions. RECOMB 2003: 57-66 - Jeremy Buhler, Uri Keich, Yanni Sun:
Designing seeds for similarity search in genomic DNA. RECOMB 2003: 67-75 - Derek Y. Chiang, Alan M. Moses, Manolis Kamvysselis, Eric S. Lander, Michael B. Eisen:
Phylogenetically and spatially conserved word pairs associated with gene expression changes in yeasts. RECOMB 2003: 84-93 - Benny Chor, Amit Khetan, Sagi Snir:
Maximum likelihood on four taxa phylogenetic trees: analytic solutions. RECOMB 2003: 76-83 - Andrew G. Clark:
Haplotype phase inference. RECOMB 2003: 94-94 - Minghua Deng, Ting Chen, Fengzhu Sun:
An integrated probabilistic model for functional prediction of proteins. RECOMB 2003: 95-103 - Maáyan Fishelson, Dan Geiger:
Optimizing exact genetic linkage computations. RECOMB 2003: 114-121 - Áprád Furka:
Combinatorial synthesis on macroscopic solid support units. RECOMB 2003: 122-122 - Aristides Gionis, Heikki Mannila:
Finding recurrent sources in sequences. RECOMB 2003: 123-130 - Gideon Greenspan, Dan Geiger:
Model-based inference of haplotype block variation. RECOMB 2003: 131-137 - David Haussler:
Computational analysis of the human and other mammalian genomes. RECOMB 2003: 138-138 - Andreas Heger, Michael Lappe, Liisa Holm:
Accurate detection of very sparse sequence motifs. RECOMB 2003: 139-147 - Andrew B. Kahng, Ion I. Mandoiu, Pavel A. Pevzner, Sherief Reda, Alexander Zelikovsky:
Engineering a scalable placement heuristic for DNA probe arrays. RECOMB 2003: 148-156 - Manolis Kamvysselis, Nick Patterson, Bruce Birren, Bonnie Berger, Eric S. Lander:
Whole-genome comparative annotation and regulatory motif discovery in multiple yeast species. RECOMB 2003: 157-16 - Eleazar Eskin, Eran Halperin, Richard M. Karp:
Large scale reconstruction of haplotypes from genotype data. RECOMB 2003: 104-113 - Balaji Krishnapuram, Lawrence Carin, Alexander J. Hartemink:
Joint classifier and feature optimization for cancer diagnosis using gene expression data. RECOMB 2003: 167-175 - Christopher James Langmead, Anthony K. Yan, Ryan H. Lilien, Lincong Wang, Bruce Randall Donald:
Large a polynomial-time nuclear vector replacement algorithm for automated NMR resonance assignments. RECOMB 2003: 176-187 - Neal Lesh, Michael Mitzenmacher, Sue Whitesides:
A complete and effective move set for simplified protein folding. RECOMB 2003: 188-195 - Arthur M. Lesk:
Invited: Prediction of protein function. RECOMB 2003: 196-196 - Wentian Li, Ivo Grosse:
Gene selection criterion for discriminant microarray data analysis based on extreme value distributions. RECOMB 2003: 217-223 - Jing Li, Tao Jiang:
Efficient rule-based haplotyping algorithms for pedigree data. RECOMB 2003: 197-206 - Lei M. Li, Jong Hyun Kim, Michael S. Waterman:
Haplotype reconstruction from SNP alignment. RECOMB 2003: 207-216 - Niranjan Nagarajan, Golan Yona:
A multi-expert system for the automatic detection of protein domains from sequence information. RECOMB 2003: 224-234 - Christiane Nüsslein-Volhard:
Invited. RECOMB 2003: 235-235
skipping 15 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-05-29 11:54 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