Zobrazeno 1 - 10
of 225
pro vyhledávání: '"LCP array"'
Publikováno v:
Algorithms for Molecular Biology, Vol 17, Iss 1, Pp 1-22 (2022)
Abstract The development of a privacy-preserving technology is important for accelerating genome data sharing. This study proposes an algorithm that securely searches a variable-length substring match between a query and a database sequence. Our conc
Externí odkaz:
https://doaj.org/article/108657317ce04001baf4c1816de84486
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:
Algorithms for Molecular Biology, Vol 14, Iss 1, Pp 1-13 (2019)
Abstract Background Sequencing technologies keep on turning cheaper and faster, thus putting a growing pressure for data structures designed to efficiently store raw data, and possibly perform analysis therein. In this view, there is a growing intere
Externí odkaz:
https://doaj.org/article/ea5887a560054b21960a87395423e13e
Publikováno v:
Theoretical Computer Science. 942:180-199
The suffix array, perhaps the most important data structure in modern string processing, is often augmented with the longest common prefix (LCP) array which stores the lengths of the LCPs for lexicographically adjacent suffixes of a string. Together
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c50058727f2829de2e2a84a43cc0e45
https://doi.org/10.1016/j.tcs.2022.11.032
https://doi.org/10.1016/j.tcs.2022.11.032
Publikováno v:
Algorithms for Molecular Biology, Vol 12, Iss 1, Pp 1-16 (2017)
Abstract Background Suffix arrays, augmented by additional data structures, allow solving efficiently many string processing problems. The external memory construction of the generalized suffix array for a string collection is a fundamental task when
Externí odkaz:
https://doaj.org/article/bc8337213dc2403ea213db794ca99cb2
Autor:
Amihood Amir, Eitan Kondratovsky
Publikováno v:
Theoretical Computer Science. 852:132-137
Parameterized matching has proven to be an efficient and useful tool for detecting code duplications. This paper presents a technique for calculating parameterized Longest Common Prefix ( p l c p ) in constant time based on the knowledge about the p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1aadfadaf92d46cb90d978a1ec4952cc
https://doi.org/10.1016/j.tcs.2020.11.023
https://doi.org/10.1016/j.tcs.2020.11.023
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.
Publikováno v:
UnpayWall
ORCID
Microsoft Academic Graph
Theoretical Computer Science
ORCID
Microsoft Academic Graph
Theoretical Computer Science
Indexing very large collections of strings, such as those produced by the widespread next generation sequencing technologies, heavily relies on multi-string generalization of the Burrows–Wheeler Transform (BWT): large requirements of in-memory appr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1bab8b0f53f313c47c7558236e897d36
https://doi.org/10.1016/j.tcs.2020.11.041
https://doi.org/10.1016/j.tcs.2020.11.041
Publikováno v:
ACM Transactions on Algorithms. 16:1-53
Given a text T of length n , we propose a deterministic online algorithm computing the sparse suffix array and the sparse longest common prefix array of T in O( c √ lg n + m lg m lg n lg * n ) time with O( m ) words of space under the premise that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c9d199a51b37200a226cffdd582081d
https://doi.org/10.1145/3398681
https://doi.org/10.1145/3398681
Autor:
Wing-Kai Hon, Kotaro Matsuda, Sharma V. Thankachan, Paniz Abedin, Yakov Nekrich, Rahul Shah, Arnab Ganguly, Kunihiko Sadakane
Publikováno v:
Theoretical Computer Science. 822:15-22
Let T [ 1 , n ] be a text of length n and T [ i , n ] be the suffix starting at position i. Also, for any two strings X and Y, let LCP ( X , Y ) denote their longest common prefix. The range-LCP of T w.r.t. a range [ α , β ] , where 1 ≤ α β ≤
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d362fd5e30f5505903afc3a183186658
https://doi.org/10.1016/j.tcs.2020.04.009
https://doi.org/10.1016/j.tcs.2020.04.009