作者: Orchiectomy 時間: 2025-3-21 21:45
A Framework for Space-Efficient String Kernels,tructures that are either space-inefficient, or incur large slowdowns. We show that a number of exact string kernels, like the .-mer kernel, the substrings kernels, a number of length-weighted kernels, the minimal absent words kernel, and kernels with Markovian corrections, can all be computed in . 作者: 親愛 時間: 2025-3-22 01:31 作者: Forsake 時間: 2025-3-22 07:02
Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis,en the genomes of many individuals/strains of the same or closely related species. They devised an . time algorithm called splitMEM that constructs this graph directly (i.e., without using the uncompressed de Bruijn graph) based on a suffix tree, where . is the total length of the genomes and . is t作者: 與野獸博斗者 時間: 2025-3-22 09:54
Longest Common Extensions in Trees, problem asks to preprocess a string into a compact data structure that supports fast LCE queries..In this paper we generalize the LCE problem to trees and suggest a few applications of LCE in trees to tries and XML databases. Given a labeled and rooted tree . of size ., the goal is to preprocess . 作者: octogenarian 時間: 2025-3-22 16:02 作者: octogenarian 時間: 2025-3-22 20:52 作者: 甜食 時間: 2025-3-22 21:31 作者: 脖子 時間: 2025-3-23 05:27
On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem,, called ., possibly affected by sequencing errors. . (MEC) is a prominent computational problem for haplotype assembly and, given a set of fragments, aims at reconstructing the two haplotypes by applying the minimum number of base corrections..By using novel combinatorial properties of MEC instance作者: ESPY 時間: 2025-3-23 06:50 作者: Common-Migraine 時間: 2025-3-23 10:46 作者: Pageant 時間: 2025-3-23 16:43 作者: PAGAN 時間: 2025-3-23 18:48 作者: 牌帶來 時間: 2025-3-24 02:02
Alphabet-Dependent String Searching with Wexponential Search Trees,deterministic time, whereas in dynamic tries we achieve . deterministic time per query or update. One particular application of the above bounds (static and dynamic) are suffix trees, where we also show how to pre- or append letters in . time. Our main technical contribution is a weighted variant of作者: Inferior 時間: 2025-3-24 02:43
Succinct Non-overlapping Indexing,comes as input, we can report a maximal set of non-overlapping occurrences of . in .. The best known solution for this problem takes linear space, in which a suffix tree of . is augmented with .-word data structures. A query . can be answered in optimal . time, where . is the output size [Cohen and 作者: 猜忌 時間: 2025-3-24 07:17 作者: THE 時間: 2025-3-24 12:10 作者: 極微小 時間: 2025-3-24 16:25
,: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding,ization of a string is the concatenation of the two longest previous factors, while each factor of the LZ78 factorization is that of the longest previous factor and the following character. Interestingly, this simple modification drastically improves the compression ratio in practice. We propose two作者: Asseverate 時間: 2025-3-24 20:29 作者: 怕失去錢 時間: 2025-3-25 03:08 作者: LEVY 時間: 2025-3-25 05:05 作者: 恫嚇 時間: 2025-3-25 08:14
Liang-Yin Chu,Rui Xie,Xiao-Jie Ju,Wei Wangic and dynamic) are suffix trees, where we also show how to pre- or append letters in . time. Our main technical contribution is a weighted variant of exponential search trees, which might be of independent interest.作者: 飛鏢 時間: 2025-3-25 13:48
Longest Common Extensions in Sublinear Space,y time. In this paper we show that for any trade-off parameter ., the problem can be solved in . space and . query time. This significantly improves the previously best known time-space trade-offs, and almost matches the best known time-space product lower bound.作者: DRILL 時間: 2025-3-25 18:54
Alphabet-Dependent String Searching with Wexponential Search Trees,ic and dynamic) are suffix trees, where we also show how to pre- or append letters in . time. Our main technical contribution is a weighted variant of exponential search trees, which might be of independent interest.作者: Keshan-disease 時間: 2025-3-25 20:32 作者: 虛弱 時間: 2025-3-26 00:53
Christian Vetter,Mariia Semenovathat such a parameterization does not admit a polynomial kernel up?to some complexity assumption. We also obtain several results about “below guaranteed values” parameterization of the problem. We show that parameterization by compression admits a polynomial kernel while parameterization “below matching” is hard.作者: 怎樣才咆哮 時間: 2025-3-26 07:22
Liang-Yin Chu,Rui Xie,Xiao-Jie Ju,Wei Wanglects the length of the strings from which the overlap digraph is constructed. We study the asymptotic behaviour of readability by casting it in purely graph theoretic terms (without any reference to strings). We prove upper and lower bounds on readability for certain graph families and general graphs.作者: 仲裁者 時間: 2025-3-26 10:04
Liang-Yin Chu,Rui Xie,Xiao-Jie Ju,Wei Wang is known that this problem can be solved in . time. In this paper, we first propose an .-time algorithm for the problem based on interesting properties of boxed subsequences. Then, we give a further improved algorithm which runs in . time using preprocessed information on . and order-statistics trees.作者: growth-factor 時間: 2025-3-26 12:38 作者: 租約 時間: 2025-3-26 18:58
Ranked Document Retrieval with Forbidden Pattern, obtain a linear space and . query time solution for the document listing problem, where . is the number of documents reported. We conjecture that any significant improvement over the results in this paper is highly unlikely.作者: Inscrutable 時間: 2025-3-27 00:01
Parameterized Complexity of Superstring Problems,that such a parameterization does not admit a polynomial kernel up?to some complexity assumption. We also obtain several results about “below guaranteed values” parameterization of the problem. We show that parameterization by compression admits a polynomial kernel while parameterization “below matching” is hard.作者: 浮夸 時間: 2025-3-27 01:17 作者: installment 時間: 2025-3-27 07:02
Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem, is known that this problem can be solved in . time. In this paper, we first propose an .-time algorithm for the problem based on interesting properties of boxed subsequences. Then, we give a further improved algorithm which runs in . time using preprocessed information on . and order-statistics trees.作者: DEAF 時間: 2025-3-27 13:08 作者: MAL 時間: 2025-3-27 16:56 作者: 暫時別動 時間: 2025-3-27 17:56 作者: 有節(jié)制 時間: 2025-3-28 00:04
https://doi.org/10.1007/978-3-319-94523-1how that the problem is .-hard. In addition we consider restricted versions of the problem where a node can only participate in a bounded number of swaps. We show that the problem is .-hard under these restrictions as well.作者: 結(jié)合 時間: 2025-3-28 02:36 作者: meretricious 時間: 2025-3-28 07:35 作者: TEN 時間: 2025-3-28 13:08 作者: BOOR 時間: 2025-3-28 16:13 作者: 跳動 時間: 2025-3-28 20:00
A Framework for Space-Efficient String Kernels, time per element in its output. The same bounds hold for a number of measures of compositional complexity based on multiple values of ., like the .-mer profile and the .-th order empirical entropy, and for calibrating the value of . using the data.作者: 高深莫測 時間: 2025-3-29 02:13
Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis,r algorithm has a better worst-case time complexity of ., where . is the size of the alphabet (. for DNA). Moreover, experiments show that it is much faster than splitMEM while using only a fraction of the space required by splitMEM.作者: Ordeal 時間: 2025-3-29 03:14
Succinct Non-overlapping Indexing,uffix range of . in . time, and (ii) a suffix array or an inverse suffix array value in . time; then by using . alone, we can answer a query . in . time. Additionally, we present an improved result for a generalized version of this problem called ..作者: Eulogy 時間: 2025-3-29 07:32
Composite Repetition-Aware Data Structures, the number of extensions of maximal repeats. The combination of CDAWG and RLBWT enables also a new representation of the suffix tree, whose size depends again on the number of extensions of maximal repeats, and that is powerful enough to support matching statistics and constant-space traversal.作者: olfction 時間: 2025-3-29 13:25
Longest Common Extensions in Trees,ng that any path-tree LCE structure of size . must necessarily use . time to answer queries. For . queries, we present a time-space trade-off, that given any parameter ., ., leads to an . space and . query-time solution. This is complemented with a reduction to the set intersection problem implying 作者: HAIL 時間: 2025-3-29 18:13 作者: 監(jiān)禁 時間: 2025-3-29 21:44 作者: 脊椎動物 時間: 2025-3-30 03:26
Range Minimum Query Indexes in Higher Dimensions, of designing indexing data structures for RMQs in higher dimensions. We design a data structure of size .. that supports RMQs in constant time for a constant number of dimensions. We also show how to obtain trade-offs between the space of indexing data structures and their query time.作者: 撕裂皮肉 時間: 2025-3-30 07:05 作者: 忍受 時間: 2025-3-30 08:50 作者: Anthem 時間: 2025-3-30 16:02 作者: frugal 時間: 2025-3-30 20:26
https://doi.org/10.1007/978-3-658-30267-2ng that any path-tree LCE structure of size . must necessarily use . time to answer queries. For . queries, we present a time-space trade-off, that given any parameter ., ., leads to an . space and . query-time solution. This is complemented with a reduction to the set intersection problem implying 作者: 無力更進(jìn) 時間: 2025-3-30 22:29
Smart Human Resource Management factor while it is approximable within factor . where . is the size of the input. Finally, we provide a practical 2-approximation algorithm for the Binary MEC, a variant of MEC that has been applied in the framework of clustering binary data.作者: Extemporize 時間: 2025-3-31 01:03
https://doi.org/10.1007/978-3-642-39538-3e required to access the dictionary data, which can be maintained in compressed form). Our results are parameterized for a space-time tradeoff..We propose more results for the case of lookup queries with one insertion/deletion on dictionaries over a constant sized alphabet. These results are especia作者: commute 時間: 2025-3-31 06:09
Liang-Yin Chu,Rui Xie,Xiao-Jie Ju,Wei Wang of designing indexing data structures for RMQs in higher dimensions. We design a data structure of size .. that supports RMQs in constant time for a constant number of dimensions. We also show how to obtain trade-offs between the space of indexing data structures and their query time.作者: Dawdle 時間: 2025-3-31 10:19 作者: vanquish 時間: 2025-3-31 14:00
https://doi.org/10.1007/978-3-642-02368-2ixed-length code word. The LZD factorization and its versions with variable-to-fixed encoding are actually grammar-based compression, and our experiments show that our algorithms outperform the state-of-the-art online grammar-based compression algorithms on several data sets.作者: 使糾纏 時間: 2025-3-31 19:22 作者: 矛盾 時間: 2025-3-31 22:27 作者: sparse 時間: 2025-4-1 01:50
Liang-Yin Chu,Rui Xie,Xiao-Jie Ju,Wei WangFor both the Lempel Ziv 77- and 78-factorization we propose factorization algorithms using . bits (for any positive constant .) working space (including the space for the output) for any text of size . over an integer alphabet in . time.作者: Keshan-disease 時間: 2025-4-1 07:46
Lempel Ziv Computation in Small Space (LZ-CISS),For both the Lempel Ziv 77- and 78-factorization we propose factorization algorithms using . bits (for any positive constant .) working space (including the space for the output) for any text of size . over an integer alphabet in . time.作者: 災(zāi)禍 時間: 2025-4-1 11:39
Combinatorial Pattern Matching978-3-319-19929-0Series ISSN 0302-9743 Series E-ISSN 1611-3349
