Остановите войну!
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 49 matches
- 1997
- Richa Agarwala, Serafim Batzoglou, Vlado Dancík, Scott E. Decatur, Martin Farach, Sridhar Hannenhalli, S. Muthukrishnan, Steven Skiena:
Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model. RECOMB 1997: 1-2 - Tatsuya Akutsu, Satoru Miyano:
On the approximation of protein threading. RECOMB 1997: 3-8 - Eric L. Anson, Eugene W. Myers:
ReAligner: a program for refining DNA sequence multi-alignments. RECOMB 1997: 9-16 - Amir Ben-Dor, Benny Chor:
On constructing radiation hybrid maps (extended abstract). RECOMB 1997: 17-26 - Gary Benson:
Sequence alignment with tandem duplication. RECOMB 1997: 27-36 - Bonnie Berger, Mona Singh:
An iterative method for improved protein structural motif recognition. RECOMB 1997: 37-46 - Erich Bornberg-Bauer:
Chain growth algorithms for HP-type lattice proteins. RECOMB 1997: 47-55 - J. Richard Bradley, Steven Skiena:
Fabricating arrays of strings. RECOMB 1997: 57-66 - Weiping Cai, Anne Condon, Robert M. Corn, Elton Glaser, Zhengdong Fei, Tony Frutos, Zhen Guo, Max G. Lagally, Qinghua Liu, Lloyd M. Smith, Andrew Thiel:
The power of surface-based DNA computation (extended abstract). RECOMB 1997: 67-74 - Alberto Caprara:
Sorting by reversals is difficult. RECOMB 1997: 75-83 - Thomas Christof, Michael Jünger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt:
A branch-and-cut approach to physical mapping with end-probes. RECOMB 1997: 84-92 - Gary A. Churchill:
Monte Carlo sequence alignment. RECOMB 1997: 93-97 - Jaime Cohen, Martin Farach:
Numerical taxonomy on data (abstract): experimental results. RECOMB 1997: 98 - Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Z. Sweedyk:
On the complexity and approximation of syntenic distance. RECOMB 1997: 99-108 - Ken A. Dill, Andrew T. Phillips, J. Ben Rosen:
Protein structure prediction and potential energy landscape analysis using continuous global minimization. RECOMB 1997: 109-117 - Daniel P. Fasulo, Tao Jiang, Richard M. Karp, Reuben J. Settergren, Edward C. Thayer:
An algorithmic approach to multiple complete digest mapping. RECOMB 1997: 118-127 - William E. Hart:
On the computational complexity of sequence design problems. RECOMB 1997: 128-136 - William E. Hart, Sorin Istrail:
Lattice and off-lattice side chain models of protein folding (extended abstract): linear time structure prediction better than 86% of optimal. RECOMB 1997: 137-146 - S. C. Heath:
The application of Markov chain Monte Carlo methods to radiation hybrid mapping. RECOMB 1997: 147-150 - Mudita Jain, Eugene W. Myers:
Algorithms for computing and integrating physical maps using unique probes. RECOMB 1997: 151-161 - Tao Jiang, Richard M. Karp:
Mapping clones with a given ordering or interleaving (abstract). RECOMB 1997: 162 - Haim Kaplan, Ron Shamir, Robert Endre Tarjan:
Faster and simpler algorithm for sorting signed permutations by reversals. RECOMB 1997: 163 - Samuel Karlin:
Assessing inhomogeneities in bacterial long genomic sequences. RECOMB 1997: 164-171 - Johnathan King:
Problems in understanding the structure and assembly of viruses (abstract). RECOMB 1997: 173 - George A. Komatsoulis, Michael S. Waterman:
Chimeric alignment by dynamic programming: algorithm and biological uses. RECOMB 1997: 174-180 - Hans-Peter Lenhof:
New contact measures for the protein docking problem. RECOMB 1997: 182-191 - Shili Lin, Terence P. Speed:
An algorithm for haplotype analysis. RECOMB 1997: 192-200 - Robert J. Lipshutz:
DNA probe arrays - accessing the genome (abstract). RECOMB 1997: 201 - Hiroshi Mamitsuka:
Supervised learning of hidden Markov models for sequence discrimination. RECOMB 1997: 202-208 - S. Muthukrishnan, Laxmi Parida:
Towards constructing physical maps by optical mapping (extended abstract): an effective, simple, combinatorial approach. RECOMB 1997: 209-219
skipping 19 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-01 08:58 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