Остановите войну!
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 36 matches
- 2007
- Amihood Amir, Johannes Fischer, Moshe Lewenstein:
Two-Dimensional Range Minimum Queries. CPM 2007: 286-294 - Amihood Amir, Oren Kapah, Ely Porat:
Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications. CPM 2007: 183-194 - Diego Arroyuelo, Gonzalo Navarro:
A Lempel-Ziv Text Index on Secondary Storage. CPM 2007: 83-94 - Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur:
Finding Witnesses by Peeling. CPM 2007: 28-39 - Maxime Benoît-Gagné, Sylvie Hamel:
A New and Faster Method of Sorting by Transpositions. CPM 2007: 131-141 - Philip Bille, Rolf Fagerberg, Inge Li Gørtz:
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts. CPM 2007: 52-62 - Mathilde Bouvel, Dominique Rossin, Stéphane Vialette:
Longest Common Separable Pattern Among Permutations. CPM 2007: 316-327 - Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zhiyu Zhao, Binhai Zhu:
Non-breaking Similarity of Genomes with Gene Repetitions. CPM 2007: 119-130 - Gang Chen, Simon J. Puglisi, William F. Smyth:
Fast and Practical Algorithms for Computing All the Runs in a String. CPM 2007: 307-315 - Peter Clifford, Raphaël Clifford:
Self-normalised Distance with Don't Cares. CPM 2007: 63-70 - Wangsen Feng, Zhanyong Wang, Lusheng Wang:
Identification of Distinguishing Motifs. CPM 2007: 253-264 - Paolo Ferragina, Johannes Fischer:
Suffix Arrays on Words. CPM 2007: 328-339 - Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette:
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. CPM 2007: 241-252 - Travis Gagie, Giovanni Manzini:
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited. CPM 2007: 71-82 - Rodrigo González, Gonzalo Navarro:
Compressed Text Indexes with Fast Locate. CPM 2007: 216-227 - Sylvain Guillemot, Vincent Berry:
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem. CPM 2007: 274-285 - Wing-Kai Hon, Tak Wah Lam, Rahul Shah, Siu-Lung Tam, Jeffrey Scott Vitter:
Cache-Oblivious Index for Approximate String Matching. CPM 2007: 40-51 - Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen:
Algorithms for Computing the Longest Parameterized Common Subsequence. CPM 2007: 265-273 - Tao Jiang:
A Combinatorial Approach to Genome-Wide Ortholog Assignment: Beyond Sequence Similarity Search. CPM 2007: 1 - Haim Kaplan, Elad Verbin:
Most Burrows-Wheeler Based Compressors Are Not Optimal. CPM 2007: 107-118 - Juhani Karhumäki, Yury Lifshits, Wojciech Rytter:
Tiling Periodicity. CPM 2007: 295-306 - Carmel Kent, Moshe Lewenstein, Dafna Sheinwald:
On Demand String Sorting over Unbounded Alphabets. CPM 2007: 16-27 - Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim, Kunsoo Park:
A Simple Construction of Two-Dimensional Suffix Trees in Linear Time. CPM 2007: 352-364 - Sunho Lee, Kunsoo Park:
Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts. CPM 2007: 95-106 - Yury Lifshits:
Processing Compressed Texts: A Tractability Border. CPM 2007: 228-240 - Shay Mozes, Oren Weimann, Michal Ziv-Ukelson:
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. CPM 2007: 4-15 - S. Muthukrishnan:
Stringology: Some Classic and Some Modern Problems. CPM 2007: 2 - Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficient Computation of Substring Equivalence Classes with Suffix Arrays. CPM 2007: 340-351 - Zeshan Peng, Hing-Fung Ting:
Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge. CPM 2007: 195-204 - Ely Porat, Ohad Lipsky:
Improved Sketching of Hamming Distance with Error Correcting. CPM 2007: 173-182
skipping 6 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-03-28 21:41 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