Zobrazeno 1 - 10
of 235
pro vyhledávání: '"Lange, Julian"'
Autor:
San Roman, Adrianna K., Skaletsky, Helen, Godfrey, Alexander K., Bokil, Neha V., Teitz, Levi, Singh, Isani, Blanton, Laura V., Bellott, Daniel W., Pyntikova, Tatyana, Lange, Julian, Koutseva, Natalia, Hughes, Jennifer F., Brown, Laura, Phou, Sidaly, Buscetta, Ashley, Kruszka, Paul, Banks, Nicole, Dutra, Amalia, Pak, Evgenia, Lasutschinkow, Patricia C., Keen, Colleen, Davis, Shanlee M., Lin, Angela E., Tartaglia, Nicole R., Samango-Sprouse, Carole, Muenke, Maximilian, Page, David C.
Publikováno v:
In Cell Genomics 10 January 2024 4(1)
Autor:
Pape-Lange, Julian
Cadences are structurally maximal arithmetic progressions of indices corresponding to equal characters in an underlying string. This paper provides a polynomial time detection algorithm for 3-cadences in grammar-compressed binary strings. This algori
Externí odkaz:
http://arxiv.org/abs/2008.05594
Autor:
Pape-Lange, Julian
This paper provides an upper bound for several subsets of maximal repeats and maximal pairs in compressed strings and also presents a formerly unknown relationship between maximal pairs and the run-length Burrows-Wheeler transform. This relationship
Externí odkaz:
http://arxiv.org/abs/2002.06265
Autor:
Funakoshi, Mitsuru, Pape-Lange, Julian
The discrete acyclic convolution computes the 2n-1 sums sum_{i+j=k; (i,j) in [0,1,2,...,n-1]^2} (a_i b_j) in O(n log n) time. By using suitable offsets and setting some of the variables to zero, this method provides a tool to calculate all non-zero s
Externí odkaz:
http://arxiv.org/abs/1910.11564
Publikováno v:
In Cell 24 November 2021 184(24):5970-5984
Publikováno v:
Journal of Enterprising Communities: People and Places in the Global Economy, 2018, Vol. 12, Issue 2, pp. 86-91.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/JEC-02-2018-0017
Autor:
Pape-Lange, Julian
In this thesis, we study the following three types of periodic string patterns and some of their variants. Firstly, we consider maximal d-repetitions. These are substrings that are at least 2+d times as long as their minimum period. Secondly, we cons
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Pape-Lange, Julian1 (AUTHOR) julian.pape-lange@informatik.tu-chemnitz.de
Publikováno v:
International Journal of Foundations of Computer Science. Feb/Apr2023, Vol. 34 Issue 2/3, p321-345. 25p.