Остановите войну!
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 180 matches
- 2024
- Zsuzsanna Lipták, Luca Parmigiani:
A BWT-Based Algorithm for Random de Bruijn Sequence Construction. LATIN (1) 2024: 130-145 - Yeow Meng Chee, Tuvi Etzion, Tien Long Nguyen, Duy Hoang Ta, Vinh Duc Tran, Van Khu Vu:
Maximum Length RLL Sequences in de Bruijn Graph. CoRR abs/2403.01454 (2024) - 2023
- Lisa Fiedler, Matthias Bernt, Martin Middendorf, Peter F. Stadler:
Detecting gene breakpoints in noisy genome sequences using position-annotated colored de-Bruijn graphs. BMC Bioinform. 24(1): 235 (2023) - Matthew Baker, Bhumika Mittal, Haran Mouli, Eric Tang:
On the existence of balanced generalized de Bruijn sequences. Discret. Math. 346(9): 113487 (2023) - Yupeng Jiang, Ming Li, Dongdai Lin:
Proofs of Conjectures on Extremal Weight De Bruijn Sequences. IEEE Trans. Inf. Theory 69(8): 5357-5363 (2023) - Ming Li, Dongdai Lin:
Partial Cycle Structure of FSRs and Its Applications in Searching De Bruijn Sequences. IEEE Trans. Inf. Theory 69(1): 598-609 (2023) - Lucas B. Rocha, Said Sadique Adi, Eloi Araujo:
Heuristics for the de Bruijn Graph Sequence Mapping Problem. ICCSA (1) 2023: 152-169 - Kai-Yang Peng, Heng-Sheng Hsiao, Jen-Yuan Chang:
Length-Adaptive Linear Position Sensing System Based on De-Bruijn Sequence. SENSORS 2023: 1-4 - Yeow Meng Chee, Tien Long Nguyen, Vinh Duc Tran, Van Khu Vu:
Maximal Length Constrained de Bruijn Sequences. ISIT 2023: 684-689 - J. Sawada, J. Sears, A. Trautrim, A. Williams:
Demystifying our Grandparent's De Bruijn Sequences with Concatenation Trees. CoRR abs/2308.12405 (2023) - Bin Chen, Zhenglin Liang, Shiqian Wu:
Adjacency-hopping de Bruijn Sequences for Non-repetitive Coding. CoRR abs/2309.02841 (2023) - Kacper Kapusniak, Manuel Burger, Gunnar Rätsch, Amir Joudaki:
Learning Genomic Sequence Representations using Graph Neural Networks over De Bruijn Graphs. CoRR abs/2312.03865 (2023) - 2022
- Zuling Chang, Martianus Frederic Ezerman, Adamas Aqsa Fahreza:
On greedy algorithms for binary de Bruijn sequences. Appl. Algebra Eng. Commun. Comput. 33(5): 523-550 (2022) - Thomas Krannich, W. Timothy J. White, Sebastian Niehus, Guillaume Holley, Bjarni V. Halldórsson, Birte Kehr:
Population-scale detection of non-reference sequence variants using colored de Bruijn graphs. Bioinform. 38(3): 604-611 (2022) - Abbas Alhakim:
Designing preference functions for de Bruijn sequences with forbidden words. Des. Codes Cryptogr. 90(10): 2319-2335 (2022) - Daniel Gabric, Joe Sawada:
Investigating the discrepancy property of de Bruijn sequences. Discret. Math. 345(4): 112780 (2022) - Daniel Gibney, Sharma V. Thankachan, Srinivas Aluru:
On the Hardness of Sequence Alignment on De Bruijn Graphs. J. Comput. Biol. 29(12): 1377-1396 (2022) - Abhinav Nellore, Rachel A. Ward:
Arbitrary-Length Analogs to de Bruijn Sequences. CPM 2022: 9:1-9:20 - Yeow Meng Chee, Duc Tu Dao, Long Nguyen Tien, Duy Hoang Ta, Van Khu Vu:
Run Length Limited de Bruijn Sequences for Quantum Communications. ISIT 2022: 264-269 - Musthofa, Indah Emilia Wijayanti, Diah Junia Eksi Palupi, Martianus Frederic Ezerman:
A New Approach to Determine the Minimal Polynomials of Binary Modified de Bruijn Sequences. CoRR abs/2202.01425 (2022) - Ben Cameron, Aysu Gündogan, Joe Sawada:
Cut-Down de Bruijn Sequences. CoRR abs/2205.02815 (2022) - 2021
- Yunlong Zhu, Zuling Chang, Martianus Frederic Ezerman, Qiang Wang:
An efficiently generated family of binary de Bruijn sequences. Discret. Math. 344(6): 112368 (2021) - Verónica Becher, Lucas Cortés:
Extending de Bruijn sequences to larger alphabets. Inf. Process. Lett. 168: 106085 (2021) - Zuling Chang, Martianus Frederic Ezerman, Adamas Aqsa Fahreza, San Ling, Janusz Szmidt, Huaxiong Wang:
Binary de Bruijn Sequences via Zech's Logarithms. SN Comput. Sci. 2(4): 314 (2021) - Abbas Alhakim, Evan Sala, Joe Sawada:
Revisiting the Prefer-same and Prefer-opposite de Bruijn sequence constructions. Theor. Comput. Sci. 852: 73-77 (2021) - Ming Li, Yupeng Jiang, Dongdai Lin:
Construction of De Bruijn Sequences from l-sequences. ISIT 2021: 1522-1527 - Sagi Marcovich, Tuvi Etzion, Eitan Yaakobi:
Balanced de Bruijn Sequences. ISIT 2021: 1528-1533 - Gal Amram, Amir Rubin, Gera Weiss:
A Cycle Joining Construction of the Prefer-Max De Bruijn Sequence. CoRR abs/2104.02999 (2021) - Abhinav Nellore, Rachel A. Ward:
Arbitrary-length analogs to de Bruijn sequences. CoRR abs/2108.07759 (2021) - 2020
- Yupeng Jiang, Dongdai Lin:
Longest subsequences shared by two de Bruijn sequences. Des. Codes Cryptogr. 88(7): 1463-1475 (2020)
skipping 150 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-04-25 07:28 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