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 18 matches
- 1998
- Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein:
Efficient Special Cases of Pattern Matching with Swaps. CPM 1998: 209-220 - Christian Charras, Thierry Lecroq, Joseph Daniel Pehoushek:
A Very Fast String Matching Algorithm for Small Alphabeths and Long Patterns (Extended Abstract). CPM 1998: 55-64 - Nadia El-Mabrouk, Joseph H. Nadeau, David Sankoff:
Genome Halving. CPM 1998: 235-250 - Kimmo Fredriksson, Esko Ukkonen:
A Rotation Invariant Filter for Two-Dimensional String Matching. CPM 1998: 118-125 - Yufang Hua, Tao Jiang, Bin Wu:
Aligning DNA Sequences to Minimize the Change in Protein (Extended Abstract). CPM 1998: 221-234 - John D. Kececioglu, Weiqing Zhang:
Aligning Alignments. CPM 1998: 189-208 - Dong Kyue Kim, Yoo Ah Kim, Kunsoo Park:
Constructing Suffix Arrays for Multi-dimensional Matrices. CPM 1998: 126-139 - Bin Ma, Lusheng Wang, Ming Li:
Fixed Topology Alignment with Recombination. CPM 1998: 174-188 - Gene Myers:
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming. CPM 1998: 1-13 - Eugene W. Myers, Paulo Oliva, Katia S. Guimarães:
Reporting Exact and Approximate Regular Expression Matches. CPM 1998: 91-103 - Gonzalo Navarro, Mathieu Raffinot:
A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching. CPM 1998: 14-33 - Christian N. S. Pedersen, Rune B. Lyngsø, Jotun Hein:
Comparison of Coding DNA. CPM 1998: 153-173 - Knut Magne Risvik:
Approximate Word Sequence Matching over Sparse Suffix Trees. CPM 1998: 65-79 - Jens Stoye, Dan Gusfield:
Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version). CPM 1998: 140-152 - Yanling Yang, Kaizhong Zhang, Xiong Wang, Jason Tsong-Li Wang, Dennis E. Shasha:
An Approximate Oracle for Distance in Metric Spaces. CPM 1998: 104-117 - Kaizhong Zhang:
Efficient Parallel Algorithm for the Editing Distance between Ordered Trees. CPM 1998: 80-90 - Michal Ziv-Ukelson, Aaron Kershenbaum:
A Dictionary Matching Algorithm Fast on the Average for Terms of Varying Length. CPM 1998: 34-54 - Martin Farach-Colton:
Combinatorial Pattern Matching, 9th Annual Symposium, CPM 98, Piscataway, New Jersey, USA, July 20-22, 1998, Proceedings. Lecture Notes in Computer Science 1448, Springer 1998, ISBN 3-540-64739-2 [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 2025-01-04 17:23 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