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 38 matches
- 2005
- Kazuhide Aikou, Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara:
A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables. CPM 2005: 346-357 - Tatsuya Akutsu, Daiji Fukagawa:
Inferring a Graph from Path Frequency. CPM 2005: 371-382 - Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski:
Approximate Matching in the L1 Metric. CPM 2005: 91-103 - Abdullah N. Arslan:
Regular Expression Constrained Sequence Alignment. CPM 2005: 322-333 - Behshad Behzadi, Fabrice Le Fessant:
DNA Compression Challenge Revisited: A Dynamic Programming Approach. CPM 2005: 190-200 - Mary Ellen Bock, Guido Maria Cortelazzo, Carlo Ferrari, Concettina Guerra:
Identifying Similar Surface Patches on Proteins Using a Spin-Image Surface Representation. CPM 2005: 417-428 - Sebastian Böcker, Hans-Michael Kaltenbach:
Mass Spectra Alignments and Their Significance. CPM 2005: 429-441 - Valentina Boeva, Julien Clément, Mireille Régnier, Mathias Vandenbogaert:
Assessing the Significance of Sets of Words. CPM 2005: 358-370 - Brona Brejová, Daniel G. Brown, Ian M. Harrower, Alejandro López-Ortiz, Tomás Vinar:
Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern. CPM 2005: 1-10 - Gen-Huey Chen, Jin-Ju Hong, Hsueh-I Lu:
An Optimal Algorithm for Online Square Detection. CPM 2005: 280-287 - Peter Clifford, Raphaël Clifford, Costas S. Iliopoulos:
Faster Algorithms for delta, gamma-Matching and Related Problems. CPM 2005: 68-78 - Shiri Dori, Gad M. Landau:
Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets. CPM 2005: 168-177 - Kangmin Fan, William F. Smyth, R. J. Simpson:
A New Periodicity Lemma. CPM 2005: 257-265 - David Fernández-Baca, Balaji Venkatachalam:
Parametric Analysis for Ungapped Markov Models of Evolution. CPM 2005: 394-405 - Frantisek Franek, Christopher G. Jennings, William F. Smyth:
A Simple Fast Hybrid Pattern-Matching Algorithm. CPM 2005: 288-297 - Daniel Fredouille, Christopher H. Bryant:
Speeding up Parsing of Biological Context-Free Grammars. CPM 2005: 241-256 - Yo-Sub Han, Yajun Wang, Derick Wood:
Prefix-Free Regular-Expression Matching. CPM 2005: 298-309 - Carmit Hazay, Moshe Lewenstein, Dekel Tsur:
Two Dimensional Parameterized Matching. CPM 2005: 266-279 - Paul Horton, Wataru Fujibuchi:
An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery. CPM 2005: 219-228 - Lucian Ilie, Roberto Solis-Oba, Sheng Yu:
Reducing the Size of NFAs by Using Equivalences and Preorders. CPM 2005: 310-321 - Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson:
On the Complexity of Sparse Exon Assembly. CPM 2005: 201-218 - Dong Kyue Kim, Heejin Park:
A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space. CPM 2005: 33-44 - Gad M. Landau, Laxmi Parida, Oren Weimann:
Using PQ Trees for Comparative Genomics. CPM 2005: 128-143 - Zheng Liu, Xin Chen, James Borneman, Tao Jiang:
A Fast Algorithm for Approximate String Matching on Gene Sequences. CPM 2005: 79-90 - Bin Ma, Kaizhong Zhang:
On the Longest Common Rigid Subsequence Problem. CPM 2005: 11-20 - Moritz G. Maaß, Johannes Nowak:
Text Indexing with Errors. CPM 2005: 21-32 - Veli Mäkinen, Gonzalo Navarro:
Succinct Suffix Arrays Based on Run-Length Encoding. CPM 2005: 45-56 - Ion I. Mandoiu, Dragos Trinca:
Exact and Approximation Algorithms for DNA Tag Set Design. CPM 2005: 383-393 - Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression. CPM 2005: 178-189 - Joong Chae Na:
Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets. CPM 2005: 57-67
skipping 8 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-09-25 22:52 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