Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Manuel E. Lladser"'
Autor:
Jerrad Hampton, Manuel E. Lladser
Publikováno v:
PLoS ONE, Vol 9, Iss 1 (2014)
Externí odkaz:
https://doaj.org/article/fad1b22db53a493798c0f6d85981d722
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 14 no. 2, Iss Graph Theory (2012)
Graph Theory
Externí odkaz:
https://doaj.org/article/6a4531d7e4a74df2a46ebdeb1ae31d51
Autor:
Loïck Lhote, Manuel E. Lladser
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AQ,..., Iss Proceedings (2012)
Consider a countable alphabet $\mathcal{A}$. A multi-modular hidden pattern is an $r$-tuple $(w_1,\ldots , w_r)$, where each $w_i$ is a word over $\mathcal{A}$ called a module. The hidden pattern is said to occur in a text $t$ when the later admits t
Externí odkaz:
https://doaj.org/article/843be9042c6f4ee1b008eb5e4c8d6b8f
Publikováno v:
Discrete Applied Mathematics. 320:150-169
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1105cde0232acda570f3bd93f57e41a4
https://doi.org/10.1016/j.dam.2022.04.021
https://doi.org/10.1016/j.dam.2022.04.021
Autor:
Evan D. Gorman, Manuel E. Lladser
Ultrametric matrices have a rich structure that is not apparent from their definition. Notably, the subclass of strictly ultrametric matrices are covariance matrices of certain weighted rooted binary trees. In applications, these matrices can be larg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d2c0c644d2f0068a6812110c327274a3
https://doi.org/10.1101/2022.08.21.504697
https://doi.org/10.1101/2022.08.21.504697
Autor:
Perrin E. Ruth, Manuel E. Lladser
Publikováno v:
Discrete Mathematics. 346:113310
We introduce the notion of Levenshtein graphs, an analog to Hamming graphs but using the edit distance instead of the Hamming distance; in particular, Levenshtein graphs allow for underlying strings (nodes) of different lengths. We characterize vario
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58b603654b2cf117040f9d4ed730c55a
https://doi.org/10.1016/j.disc.2022.113310
https://doi.org/10.1016/j.disc.2022.113310
Autor:
Ian Char, Manuel E. Lladser
Publikováno v:
Methodology and Computing in Applied Probability. 22:329-347
Generalized strings describe various biological motifs that arise in molecular and computational biology. In this manuscript, we introduce an alternative but efficient algorithm to construct the minimal deterministic finite automaton (DFA) associated
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4734c793688b738124a8a0caac9549fd
https://doi.org/10.1007/s11009-019-09706-8
https://doi.org/10.1007/s11009-019-09706-8
Autor:
Antony Pearson, Manuel E. Lladser
Data taking values on discrete sample spaces are the embodiment of modern biological research. "Omics" experiments produce millions of symbolic outcomes in the form of reads (i.e., DNA sequences of a few dozens to a few hundred nucleotides). Unfortun
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::212c412cb1932349fd086af222297373
https://doi.org/10.1101/2020.02.13.947754
https://doi.org/10.1101/2020.02.13.947754
Publikováno v:
PLoS ONE, Vol 6, Iss 6, p e21105 (2011)
The availability of high-throughput parallel methods for sequencing microbial communities is increasing our knowledge of the microbial world at an unprecedented rate. Though most attention has focused on determining lower-bounds on the α-diversity i
Externí odkaz:
https://doaj.org/article/440f5be266594a648759255e197e3afa
Publikováno v:
IEEE/ACM Transactions on Computational Biology and Bioinformatics. 14:1070-1081
We present a fast and simple algorithm to detect nascent RNA transcription in global nuclear run-on sequencing (GRO-seq). GRO-seq is a relatively new protocol that captures nascent transcripts from actively engaged polymerase, providing a direct read
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9760d5684698ae6c4eaf1e513a61ebe8
https://doi.org/10.1109/tcbb.2016.2520919
https://doi.org/10.1109/tcbb.2016.2520919