Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Simon Gog"'
Publikováno v:
Algorithms for Molecular Biology, Vol 15, Iss 1, Pp 1-5 (2020)
Abstract Background The construction of a suffix array for a collection of strings is a fundamental task in Bioinformatics and in many other applications that process strings. Related data structures, as the Longest Common Prefix array, the Burrows
Externí odkaz:
https://doaj.org/article/5cf5db694d514e1eab49f2be29d24638
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
The Burrows-Wheeler transform (BWT) is a well studied text transformation widely used in data compression and text indexing. The BWT of two strings can also provide similarity measures between them, based on the observation that the more their symbol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae7ac983b2d4b0bfa3bed3a30d1e3715
https://doi.org/10.1016/j.tcs.2019.03.012
https://doi.org/10.1016/j.tcs.2019.03.012
A grammar compression algorithm, called GCIS, is introduced in this work. GCIS is based on the induced suffix sorting algorithm SAIS, presented by Nong et al. in 2009. The proposed solution builds on the factorization performed by SAIS during suffix
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5952cf547e8c5728a6cbd4afacf3e59b
http://arxiv.org/abs/2011.12898
http://arxiv.org/abs/2011.12898
Publikováno v:
Algorithms for Molecular Biology : AMB
Algorithms for Molecular Biology, Vol 15, Iss 1, Pp 1-5 (2020)
Algorithms for Molecular Biology, Vol 15, Iss 1, Pp 1-5 (2020)
Background The construction of a suffix array for a collection of strings is a fundamental task in Bioinformatics and in many other applications that process strings. Related data structures, as the Longest Common Prefix array, the Burrows–Wheeler
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8fed367335b6b49e928eddab7f71d079
https://doi.org/10.1186/s13015-020-00177-y
https://doi.org/10.1186/s13015-020-00177-y
Publikováno v:
Construction of Fundamental Data Structures for Strings ISBN: 9783030551070
Suffix sorting is one of the most important tasks in string processing. In the past two decades more than 20 suffix sorting algorithms have been proposed. To date, the fastest alternatives to compute the suffix array are based on the induced sorting
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c06e1de827cf7de6c7ab959df10cb46b
https://doi.org/10.1007/978-3-030-55108-7_3
https://doi.org/10.1007/978-3-030-55108-7_3
Publikováno v:
Construction of Fundamental Data Structures for Strings ISBN: 9783030551070
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d906cacac7a3f5acfa68b70dae20cd60
https://doi.org/10.1007/978-3-030-55108-7_2
https://doi.org/10.1007/978-3-030-55108-7_2
Publikováno v:
Construction of Fundamental Data Structures for Strings ISBN: 9783030551070
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10fc9b8fb24ecd167487078db30c19ac
https://doi.org/10.1007/978-3-030-55108-7_7
https://doi.org/10.1007/978-3-030-55108-7_7
Publikováno v:
SpringerBriefs in Computer Science ISBN: 9783030551070
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::638a70a1247a019ac5d2c39228c6ba9d
https://doi.org/10.1007/978-3-030-55108-7
https://doi.org/10.1007/978-3-030-55108-7
Publikováno v:
Construction of Fundamental Data Structures for Strings ISBN: 9783030551070
The document array is a simple data structure commonly used together with the suffix array when indexing string collections. It determines to which document each suffix in the lexicographic order belongs. There exist algorithms to compute the documen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f7519b414317a2ed2df85b632927147d
https://doi.org/10.1007/978-3-030-55108-7_5
https://doi.org/10.1007/978-3-030-55108-7_5
Publikováno v:
Construction of Fundamental Data Structures for Strings ISBN: 9783030551070
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80497398d8d542d940527d002154b07e
https://doi.org/10.1007/978-3-030-55108-7_6
https://doi.org/10.1007/978-3-030-55108-7_6