Zobrazeno 1 - 10
of 275
pro vyhledávání: '"Jeffrey Scott Vitter"'
Publikováno v:
IEEE Access, Vol 5, Pp 4551-4560 (2017)
Many real-world applications, such as bioinformatics, data mining, pattern recognition, and social network analysis, benefit from efficient solutions for the graph similarity search problem. Existing methods have limited scalability when they handle
Externí odkaz:
https://doaj.org/article/78ec6d808ff641bc8dff58742d070dc1
Publikováno v:
Bioinformatics. 38:335-343
Motivation Ultrahigh-throughput next-generation sequencing instruments continue to generate vast amounts of genomic data. These data are generally stored in FASTQ format. Two important simultaneous goals are space-efficient compressed storage of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07a9fb1a8ac55b3081e8516c75aaebf5
https://doi.org/10.1093/bioinformatics/btab655
https://doi.org/10.1093/bioinformatics/btab655
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. 33:2654-2668
Graph similarity search under the graph edit distance constraint has received considerable attention in many applications, such as bioinformatics, data mining, pattern recognition and social networks. Existing methods for this problem have limited sc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::094156d4153954e2acdce2e3253325b4
https://doi.org/10.1109/tkde.2019.2954527
https://doi.org/10.1109/tkde.2019.2954527
Publikováno v:
Neurocomputing. 397:114-126
Classification and recognition of graph data are crucial problems in many fields, such as bioinformatics, chemoinformatics and data mining. In graph kernel-based classification methods, the similarity among substructures is not fully considered; in a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1edae78f7526e7ea803a97ba213a2449
https://doi.org/10.1016/j.neucom.2020.02.047
https://doi.org/10.1016/j.neucom.2020.02.047
Publikováno v:
Knowledge-Based Systems. 163:762-775
The graph edit distance (GED) is a well-established distance measure widely used in many applications, such as bioinformatics, data mining, pattern recognition, and graph classification. However, existing solutions for computing the GED suffer from s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::76519564c0f441cacf826e7646aecc77
https://doi.org/10.1016/j.knosys.2018.10.002
https://doi.org/10.1016/j.knosys.2018.10.002
Publikováno v:
IEEE/ACM transactions on computational biology and bioinformatics. 18(6)
In this paper, we focus upon the important problem of indexing and searching highly repetitive DNA sequence collections. Given a collection $G$ of t sequences $S_i$ of length n each, we can represent G succinctly in $2n\mathcal{H_k}(T) + O(n^\prime \
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d3e1ec7705e5d4e3e062cc5ea58688ee
https://pubmed.ncbi.nlm.nih.gov/31985436
https://pubmed.ncbi.nlm.nih.gov/31985436
Publikováno v:
Environmental Modelling & Software. 100:302-313
This study evaluated the potential for circuit-level electricity data to improve performance by a water end-use disaggregation tool. Support vector machine classifiers were employed to categorize observed water events from an extensive dataset publis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ebc288ef26a84c36927619b08136604f
https://doi.org/10.1016/j.envsoft.2017.11.029
https://doi.org/10.1016/j.envsoft.2017.11.029
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. :1-1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::844ed9bc41c4429879be27b2f4add562
https://doi.org/10.1109/tkde.2021.3114401
https://doi.org/10.1109/tkde.2021.3114401
Publikováno v:
Theoretical Computer Science. 638:91-97
In this paper we describe a fast algorithm that creates a wavelet tree for a sequence of symbols. We show that a wavelet tree can be constructed in O(nlog/logn) time where n is the number of symbols and is the alphabet size.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34359723584e88aaaabeb76ad744caf0
https://doi.org/10.1016/j.tcs.2015.11.011
https://doi.org/10.1016/j.tcs.2015.11.011
Publikováno v:
DCC
Chien et al. [1, 2] introduced the geometric Burrows-Wheeler transform (GBWT) as the first succinct text index for I/O-efficient pattern matching in external memory; it operates by transforming a text T into point set S in the two-dimensional plane.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::065f7e196c6cbe54352c05485c0ddf4f
https://doi.org/10.1109/dcc.2018.00030
https://doi.org/10.1109/dcc.2018.00030