Остановите войну!
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 45 matches
- 2005
- Julien Allali, Marie-France Sagot:
A Multiple Graph Layers Model with Application to RNA Secondary Structures Comparison. SPIRE 2005: 348-359 - Amihood Amir, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein:
Towards Real-Time Suffix Tree Construction. SPIRE 2005: 67-78 - Stanislav Angelov, Shunsuke Inenaga:
Composite Pattern Discovery for PCR Application. SPIRE 2005: 167-178 - Yoan José Pinzón Ardila, Raphaël Clifford, Manal Mohamed:
Necklace Swap Problem for Rhythmic Similarity Measures. SPIRE 2005: 234-245 - Nikolas Askitis, Justin Zobel:
Cache-Conscious Collision Resolution in String Hash Tables. SPIRE 2005: 91-102 - Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann:
Normalized Similarity of RNA Sequences. SPIRE 2005: 360-369 - Ricardo A. Baeza-Yates, Alejandro Salinger:
Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences. SPIRE 2005: 13-24 - Lasse Bergroth:
Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem. SPIRE 2005: 301-314 - Iwona Bialynicka-Birula, Roberto Grossi:
Rank-Sensitive Data Structures. SPIRE 2005: 79-90 - Paolo Boldi, Sebastiano Vigna:
Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups. SPIRE 2005: 25-28 - Asma Brini, Mohand Boughanem, Didier Dubois:
A Model for Information Retrieval Based on Possibilistic Networks. SPIRE 2005: 271-282 - Juan M. Cigarrán, Anselmo Peñas, Julio Gonzalo, Felisa Verdejo:
Evaluating Hierarchical Clustering of Search Results. SPIRE 2005: 49-54 - J. Shane Culpepper, Alistair Moffat:
Enhanced Byte Codes with Restricted Prefix Properties. SPIRE 2005: 1-12 - Georges Dupret, Marcelo Mendoza:
Recommending Better Queries from Click-Through Data. SPIRE 2005: 41-44 - Charles Elkan:
Deriving TF-IDF as a Fisher Kernel. SPIRE 2005: 295-300 - Yi Feng, Zhaohui Wu, Zhongmei Zhou:
Multi-label Text Categorization Using K-Nearest Neighbor Approach with M-Similarity. SPIRE 2005: 155-160 - Kimmo Fredriksson, Szymon Grabowski:
Practical and Optimal String Matching. SPIRE 2005: 376-387 - Valentin Guignon, Cédric Chauve, Sylvie Hamel:
An Edit Distance Between RNA Stem-Loops. SPIRE 2005: 335-347 - Heikki Hyyrö:
Restricted Transposition Invariant Approximate String Matching Under Edit Distance. SPIRE 2005: 256-266 - Amélie Imafouo, Xavier Tannier:
Retrieval Status Values in Information Retrieval Evaluation. SPIRE 2005: 224-227 - Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park:
Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty. SPIRE 2005: 315-326 - Grzegorz Kondrak:
N-Gram Similarity and Distance. SPIRE 2005: 115-126 - Zhigang Kong, Mounia Lalmas:
XML Multimedia Retrieval. SPIRE 2005: 218-223 - Inbok Lee, Yoan José Pinzón Ardila:
Linear Time Algorithm for the Generalised Longest Common Repeat Problem. SPIRE 2005: 191-201 - Ohad Lipsky, Ely Porat:
L1 Pattern Matching Lower Bound. SPIRE 2005: 327-330 - Ohad Lipsky, Ely Porat:
Approximate Matching in the Linfinity Metric. SPIRE 2005: 331-334 - Ping Liu, Yanbing Liu, Jianlong Tan:
A Partition-Based Efficient Algorithm for Large Scale Multiple-Strings Matching. SPIRE 2005: 399-404 - Levon Lloyd, Dimitrios Kechagias, Steven Skiena:
Lydia: A System for Large-Scale News Analysis. SPIRE 2005: 161-166 - Alessandra A. Macedo, José Antonio Camacho Guerrero, Maria da Graça Campos Pimentel:
A Bilingual Linking Service for the Web. SPIRE 2005: 45-48 - Ricardo Madariaga, José Raúl Fernández del Castillo, José Ramón Hilera:
A Generalization of the Method for Evaluation of Stemming Algorithms Based on Error Counting. SPIRE 2005: 228-233
skipping 15 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-05-28 14:43 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