Zobrazeno 1 - 10
of 498
pro vyhledávání: '"Compressed suffix array"'
Publikováno v:
Algorithms, Vol 2, Iss 3, Pp 1105-1136 (2009)
A compressed full-text self-index for a text T is a data structure requiring reduced space and able to search for patterns P in T. It can also reproduce any substring of T, thus actually replacing T. Despite the recent explosion of interest on compre
Externí odkaz:
https://doaj.org/article/97d84b220c1846c0bdefb74fd5c73b7b
Autor:
Matteo Comin, Yoshihiro Shibuya
Publikováno v:
BMC Bioinformatics, Vol 20, Iss S9, Pp 1-11 (2019)
BMC Bioinformatics
BMC Bioinformatics
Motivation Current NGS techniques are becoming exponentially cheaper. As a result, there is an exponential growth of genomic data unfortunately not followed by an exponential growth of storage, leading to the necessity of compression. Most of the ent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b39d5fcaf5e5c90efb6e8703957646d4
http://link.springer.com/article/10.1186/s12859-019-2883-5
http://link.springer.com/article/10.1186/s12859-019-2883-5
Publikováno v:
Lecture Notes in Computer Science
19th International Conference on Descriptional Complexity of Formal Systems (DCFS)
19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.287-298, ⟨10.1007/978-3-319-60252-3_23⟩
Descriptional Complexity of Formal Systems ISBN: 9783319602516
DCFS
19th International Conference on Descriptional Complexity of Formal Systems (DCFS)
19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.287-298, ⟨10.1007/978-3-319-60252-3_23⟩
Descriptional Complexity of Formal Systems ISBN: 9783319602516
DCFS
The neighbourhood of a regular language with respect to the prefix, suffix and subword distance is always regular and a tight bound for the state complexity of prefix distance neighbourhoods is known. We give upper bounds for the state complexity of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e37eea9c9de824c8f0327d9fce0a1360
https://doi.org/10.1142/s0129054119400355
https://doi.org/10.1142/s0129054119400355
Publikováno v:
Algorithmica. 82:107-117
Text indexing is a fundamental problem in computer science. The objective is to preprocess a text T, so that, given a pattern P, we can find all starting positions (or simply, occurrences) of P in $$T$$ efficiently. In some cases, additional restrict
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fde3874c10023bb7069d668621aaa882
https://doi.org/10.1007/s00453-019-00605-5
https://doi.org/10.1007/s00453-019-00605-5
Publikováno v:
Information Sciences
Temporal graphs represent binary relationships that change along time. They can model the dynamism of, for example, social and communication networks. Temporal graphs are defined as sets of contacts that are edges tagged with the temporal intervals w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::286cd8d33bbcf90e19be5a6a2e8f9bf8
https://doi.org/10.1016/j.ins.2018.07.023
https://doi.org/10.1016/j.ins.2018.07.023
Autor:
Szymon Grabowski, Marcin Raniszewski
Publikováno v:
Bulletin of the Polish Academy of Sciences Technical Sciences. 65:407-418
Full-text indexing aims at building a data structure over a given text capable of efficiently finding arbitrary text patterns, and possibly requiring little space. We propose two suffix array inspired full-text indexes. One, called SA-hash, augments
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::03e9aec5e690cce284b16d12d03f9e47
https://doi.org/10.1515/bpasts-2017-0046
https://doi.org/10.1515/bpasts-2017-0046
Publikováno v:
IETE Journal of Research. 64:87-99
With the recent increase in the size of data, compression has become essential tool for handling massive data. Compression is usually more helpful in handling huge data over the networks, large text collections, and storing massive biological data. I
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f50045c5c776ec4f3d3a94098f9c8cb
https://doi.org/10.1080/03772063.2017.1347071
https://doi.org/10.1080/03772063.2017.1347071
Publikováno v:
International Journal of Computer Applications. 170:35-39
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ae9397d392e31fd5325d20c476539fd
https://doi.org/10.5120/ijca2017914668
https://doi.org/10.5120/ijca2017914668
Publikováno v:
Knowledge and Information Systems. 55:305-331
To automatically extract data records from Web pages, the data record extraction algorithm is required to be robust and efficient. However, most of existing algorithms are not robust enough to cope with rich information or noisy data. In this paper,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ba5ad4d19e18df42095082694eaef7e
https://doi.org/10.1007/s10115-017-1062-0
https://doi.org/10.1007/s10115-017-1062-0
Publikováno v:
Theoretical Computer Science. 678:22-39
Constructing the suffix array for a string collection is an important task that may be performed by sorting the concatenation of all strings. In this article we present algorithms g SAIS and g SACA-K , which extend SAIS (Nong et al., 2011) [8] and SA
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d527132640738cd487f6102f88a19ba
https://doi.org/10.1016/j.tcs.2017.03.039
https://doi.org/10.1016/j.tcs.2017.03.039