Остановите войну!
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 20 matches
- 1993
- Tatsuya Akutsu:
A Linear Time Pattern Matching Algorithm Between a String and a Tree. CPM 1993: 1-10 - Dany Breslauer, Livio Colussi, Laura Toniolo:
Tight Comparison Bounds for the String Prefix-Matching Problem. CPM 1993: 11-19 - Daniel Fischer, Raquel Norel, Ruth Nussinov, Haim J. Wolfson:
3-D Docking of Protein Molecules. CPM 1993: 20-34 - Emmanuelle Garel:
Minimal Separators of Two Words. CPM 1993: 35-53 - Costas S. Iliopoulos, Dennis W. G. Moore, Kunsoo Park:
Covering a String. CPM 1993: 54-62 - Robert W. Irving, Campbell Fraser:
On the Worst-Case Behaviour of Some Approximation Algorithms for the Shortest Common Supersequence of k Strings. CPM 1993: 63-73 - Sampath Kannan, Eugene W. Myers:
An Algorithm for Locating Non-Overlapping Regions of Maximum Alignment Score. CPM 1993: 74-86 - John D. Kececioglu:
The Maximum Weight Trace Problem in Multiple Sequence Alignment. CPM 1993: 106-119 - John D. Kececioglu, David Sankoff:
Exact and Approximation Algorithms for the Inversion Distance Between Two Chromosomes. CPM 1993: 87-105 - Gad M. Landau, Jeanette P. Schmidt:
An Algorithm for Approximate Tandem Repeats. CPM 1993: 120-133 - Gad M. Landau, Uzi Vishkin:
Two Dimensional Pattern Matching in a Digitized Image. CPM 1993: 134-151 - Guy Louchard, Wojciech Szpankowski:
Analysis of a String Edit Problem in a Probabilistic Framework (Extended Abstract). CPM 1993: 152-163 - S. Muthukrishnan:
Detecting False Matches in String Matching Algorithms. CPM 1993: 164-178 - Dalit Naor, Douglas L. Brutlag:
On Suboptimal Alignments of Biological Sequences. CPM 1993: 179-196 - Pavel A. Pevzner, Michael S. Waterman:
A Fast Filtration Algorithm for the Substring Matching Problem. CPM 1993: 197-214 - Mireille Régnier, Ladan Rostami:
A Unifying Look at d-Dimensional Periodicities and Space Coverings. CPM 1993: 215-227 - Esko Ukkonen:
Approximate String-Matching over Suffix Trees. CPM 1993: 228-242 - Martin Vingron, Pavel A. Pevzner:
Multiple Sequence Comparison and n-Dimensional Image Reconstruction. CPM 1993: 243-253 - Kaizhong Zhang:
A New Editing based Distance between Unordered Labeled Trees. CPM 1993: 254-265 - Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber:
Combinatorial Pattern Matching, 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993, Proceedings. Lecture Notes in Computer Science 684, Springer 1993, ISBN 3-540-56764-X [contents]
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-06-11 12:08 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