![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 24 matches
- 2002
- Tatsuya Akutsu
, Hideo Bannai, Satoru Miyano, Sascha Ott:
On the Complexity of Deriving Position Specific Score Matrices from Examples. CPM 2002: 168-177 - Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier:
Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time. CPM 2002: 99-114 - Hiroki Arimura:
Efficient Text Mining with Optimized Pattern Discovery. CPM 2002: 17-19 - Brona Brejová, Tomás Vinar:
A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene Finding. CPM 2002: 190-202 - Stefan Burkhardt, Juha Kärkkäinen:
One-Gapped q-Gram Filtersfor Levenshtein Distance. CPM 2002: 225-234 - Venkatesan T. Chakaravarthy, Rajasekar Krishnamurthy:
The Problem of Context Sensitive String Matching. CPM 2002: 64-75 - Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq
, Wojciech Plandowski, Wojciech Rytter:
Three Heuristics for delta-Matching: delta-BM Algorithms. CPM 2002: 178-189 - Frantisek Franek, Jiandong Jiang, Weilin Lu, William F. Smyth:
Two-Pattern Strings. CPM 2002: 76-84 - Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen:
Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations. CPM 2002: 235-248 - Wing-Kai Hon, Kunihiko Sadakane
:
Space-Economical Algorithms for Finding Maximal Unique Matches. CPM 2002: 144-152 - Heikki Hyyrö, Gonzalo Navarro
:
Faster Bit-Parallel Approximate String Matching. CPM 2002: 203-224 - Lucian Ilie
, Sheng Yu:
Constructing NFA s by Optimal Use of Positions in Regular Expressions. CPM 2002: 279-288 - Costas S. Iliopoulos, Christos Makris
, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas:
Identifying Occurrences of Maximal Pairs in Multiple Strings. CPM 2002: 133-143 - Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara
, Hiromasa Hoshino, Setsuo Arikawa:
The Minimum DAWG for All Suffixes of a String and Its Applications. CPM 2002: 153-167 - Veli Mäkinen, Esko Ukkonen:
Local Similarity Based Point-Pattern Matching. CPM 2002: 115-132 - S. Muthukrishnan, Süleyman Cenk Sahinalp:
Simple and Practical Sequence Nearest Neighbors with Block Operations. CPM 2002: 262-278 - Jun Ogasawara, Shinichi Morishita
:
Practical Software for Aligning ESTs to Human Genome. CPM 2002: 1-16 - Jussi Rautio, Jani Tanninen, Jorma Tarhio
:
String Matching with Stopper Encoding and Code Splitting. CPM 2002: 42-52 - Wojciech Rytter:
Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression. CPM 2002: 20-31 - Süleyman Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg
, Petra Berenbrink, Tom Friedetzky, Funda Ergün:
Statistical Identification of Uniformly Mutated Segments within Repeats. CPM 2002: 249-261 - Dana Shapira, James A. Storer:
Edit Distance with Move Operations. CPM 2002: 85-98 - Stéphane Vialette:
Pattern Matching Problems over 2-Interval Sets. CPM 2002: 53-63 - Raymond Wan, Alistair Moffat:
Block Merging for Off-Line Compression. CPM 2002: 32-41 - Alberto Apostolico, Masayuki Takeda:
Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings. Lecture Notes in Computer Science 2373, Springer 2002, ISBN 3-540-43862-9 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-02 14:09 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