Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Marina Barsky"'
Publikováno v:
Viruses, Vol 2, Iss 9, Pp 1867-1885 (2010)
We describe the use of Java Pattern Finder (JaPaFi) to identify short (
Externí odkaz:
https://doaj.org/article/87d0888ce7804861974ad1594379e395
Publikováno v:
Proceedings of the VLDB Endowment. 13:2787-2800
We investigate the problem of building a suffix array substring index for inputs significantly larger than main memory. This problem is especially important in the context of biological sequence analysis, where biological polymers can be thought of a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27d8f67fd151331bcdb608217be80977
https://doi.org/10.14778/3407790.3407861
https://doi.org/10.14778/3407790.3407861
Nowadays, textual databases are among the most rapidly growing collections of data. Some of these collections contain a new type of data that differs from classical numerical or textual data. These are long sequences of symbols, not divided into well
Publikováno v:
Proceedings of the VLDB Endowment. 9:13-23
Studying the topology of a network is critical to inferring underlying dynamics such as tolerance to failure, group behavior and spreading patterns. k -core decomposition is a well-established metric which partitions a graph into layers from external
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9e06f62d42a8e4536962f5a6065d15de
https://doi.org/10.14778/2850469.2850471
https://doi.org/10.14778/2850469.2850471
Publikováno v:
Full-Text (Substring) Indexes in External Memory
Nowadays, textual databases are among the most rapidly growing collections of data. Some of these collections contain a new type of data that differs from classical numerical or textual data. These are long sequences of symbols, not divided into well
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::424266dce9a589a7979287a3871c8fd2
https://doi.org/10.2200/s00396ed1v01y201111dtm022
https://doi.org/10.2200/s00396ed1v01y201111dtm022
Publikováno v:
Scopus-Elsevier
In this paper we introduce a new type of pattern -- a flipping correlation pattern. The flipping patterns are obtained from contrasting the correlations between items at different levels of abstraction. They represent surprising correlations, both po
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c1630134de8065621f3e72d0c742a892
https://doi.org/10.14778/2095686.2095695
https://doi.org/10.14778/2095686.2095695
Publikováno v:
Information Systems. 36:644-654
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current methods for constructing suffix trees do not scale for large inputs. As suff
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6fb98ee5a45b39a202695256b12cc14a
https://doi.org/10.1016/j.is.2010.11.001
https://doi.org/10.1016/j.is.2010.11.001
Publikováno v:
ACM Journal of Experimental Algorithmics. 12:1-26
We present a novel graph model and an efficient algorithm for solving the “threshold all against all” problem, which involves searching two strings (with length M and N , respectively) for all maximal approximate substring matches of length at le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bfe3d0e50aadec57b4fcef43fac93a87
https://doi.org/10.1145/1227161.1370601
https://doi.org/10.1145/1227161.1370601
Publikováno v:
BMC Research Notes
Background Large DNA sequence data sets require special bioinformatics tools to search and compare them. Such tools should be easy to use so that the data can be easily accessed by a wide array of researchers. In the past, the use of suffix trees for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::964ada4f5407e6b5a6f2d3a4c3035d97
https://doi.org/10.1186/1756-0500-7-466
https://doi.org/10.1186/1756-0500-7-466
Nowadays, textual databases are among the most rapidly growing collections of data. Some of these collections contain a new type of data that differs from classical numerical or textual data. These are long sequences of symbols, not divided into well