Остановите войну!
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 22 matches
- 2023
- Yubo Li, Liying Tian, Yihuang Zeng:
Spectrally-Null-Constrained ZCZ Sequences for MIMO-OFDM Channel Estimation Over Non-Contiguous Carriers. IEEE Commun. Lett. 27(2): 442-446 (2023) - Zefeng Chen, Wensheng Gan, Gengsen Huang, Yanxin Zheng, Philip S. Yu:
Towards Contiguous Sequences in Uncertain Data. DSAA 2023: 1-10 - 2022
- Bingsheng Shen, Yang Yang, Pingzhi Fan, Zhengchun Zhou:
Constructions of Non-Contiguous Complementary Sequence Sets and Their Applications. IEEE Trans. Wirel. Commun. 21(7): 4871-4882 (2022) - 2021
- Cody Glickman, Jo Hendrix, Michael Strong:
Simulation study and comparative evaluation of viral contiguous sequence identification tools. BMC Bioinform. 22(1): 329 (2021) - Mohammad Shahedul Islam, Md. Abul Kashem Mia, Mohammad Shamsur Rahman, Mohammad Shamsul Arefin, Pranab Kumar Dhar, Takeshi Koshiba:
Frequent contiguous pattern mining over biological sequences of protein misfolded diseases. BMC Bioinform. 22(1): 435 (2021) - Andrzej Chmielowiec:
Algorithm for error-free determination of the variance of all contiguous subsequences and fixed-length contiguous subsequences for a sequence of industrial measurement data. Comput. Stat. 36(4): 2813-2840 (2021) - Chunkai Zhang, Quanjian Dai, Zilin Du, Wensheng Gan, Jian Weng, Philip S. Yu:
Utility-driven Mining of Contiguous Sequences. CoRR abs/2111.00247 (2021) - 2018
- Kyu-Seok Shim, Young-Hoon Goo, Min-Seob Lee, Huru Hasanova, Myung-Sup Kim:
Inference of network unknown protocol structure using CSP(Contiguous Sequence Pattern) algorithm based on tree structure. NOMS 2018: 1-4 - 2016
- Abdolvahed Pari, Ahmad Baraani, Saeed Parseh:
NSAMD: A new approach to discover structured contiguous substrings in sequence datasets using Next-Symbol-Array. Comput. Biol. Chem. 64: 384-395 (2016) - Jingsong Zhang, Yinglin Wang, Chao Zhang, Yongyong Shi:
Mining Contiguous Sequential Generators in Biological Sequences. IEEE ACM Trans. Comput. Biol. Bioinform. 13(5): 855-867 (2016) - Jialei Wang, Peder A. Olsen, Andrew R. Conn, Aurélie C. Lozano:
Removing Clouds and Recovering Ground Observations in Satellite Image Sequences via Temporally Contiguous Robust Matrix Completion. CVPR 2016: 2754-2763 - B. John Oommen, Sang-Woon Kim:
Multinomial Sequence Based Estimation Using Contiguous Subsequences of Length Three. ICIAR 2016: 243-253 - Jialei Wang, Peder A. Olsen, Andrew R. Conn, Aurélie C. Lozano:
Removing Clouds and Recovering Ground Observations in Satellite Image Sequences via Temporally Contiguous Robust Matrix Completion. CoRR abs/1604.03915 (2016) - 2013
- Ricardo C. Corrêa, Pablo Mayckon Silva Farias, Críston P. de Souza:
Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence. J. Discrete Algorithms 21: 1-10 (2013) - Carlos Eduardo Rodrigues Alves, Edson Norberto Cáceres, Siang Wun Song:
Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds. IEEE Trans. Parallel Distributed Syst. 24(4): 724-733 (2013) - 2012
- Ricardo C. Corrêa, Pablo Mayckon Silva Farias, Críston P. de Souza:
Insertion and Sorting in a Sequence of Numbers Minimizing the Maximum Sum of a Contiguous Subsequence. CoRR abs/1210.5955 (2012) - 2010
- Cedomir Stefanovic, Dragana Bajic:
Acquisition Times of Contiguous and Distributed Marker Sequences: A Cross-Bifix Analysis. SETA 2010: 55-66 - 2009
- Jun Sun, Min Zhang, Chew Lim Tan:
A non-contiguous Tree Sequence Alignment-based Model for Statistical Machine Translation. ACL/IJCNLP 2009: 914-922 - 2007
- Tae Ho Kang, Jae Soo Yoo, Hak Yong Kim:
Mining Frequent Contiguous Sequence Patterns in Biological Sequences. BIBE 2007: 723-728 - Xinqiang Zuo, Yuanbing Zhou, Chunhui Zhao:
Elastic Non-contiguous Sequence Pattern Detection for Data Stream Monitoring. IDEAL 2007: 599-608 - 2006
- Carlos E. R. Alves, Edson Norberto Cáceres, Siang Wun Song:
A BSP/CGM Algorithm for Finding All Maximal Contiguous Subsequences of a Sequence of Numbers. Euro-Par 2006: 831-840 - 2004
- Nikos Mamoulis, Man Lung Yiu:
Non-contiguous Sequence Pattern Queries. EDBT 2004: 783-800
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-05 20:49 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