作者: 本能 時間: 2025-3-21 22:38 作者: FRET 時間: 2025-3-22 03:59 作者: capsaicin 時間: 2025-3-22 08:09
Distributed Load Sharing Under Cyber Attacksded by the entropy of the source asymptotically tends to 1..We experimentally corroborate our theoretical bounds. Furthermore, we compare BWT-based compressors to other compressors and show that for “realistic” Markov sources they indeed perform bad and often worse than other compressors. This is in作者: Gratulate 時間: 2025-3-22 09:37
A Combinatorial Approach to Genome-Wide Ortholog Assignment: Beyond Sequence Similarity Searchmization problems, minimum common partition and maximum cycle decomposition. Following this approach, we have implemented a high-throughput system for assigning orthologs on a genome scale, called MSOAR, and tested it on both simulated data and real genome sequence data. Our predicted orthologs betw作者: crutch 時間: 2025-3-22 13:03 作者: crutch 時間: 2025-3-22 18:01 作者: 新娘 時間: 2025-3-22 21:36
Most Burrows-Wheeler Based Compressors Are Not Optimalded by the entropy of the source asymptotically tends to 1..We experimentally corroborate our theoretical bounds. Furthermore, we compare BWT-based compressors to other compressors and show that for “realistic” Markov sources they indeed perform bad and often worse than other compressors. This is in作者: 法律的瑕疵 時間: 2025-3-23 04:43
0302-9743 uch structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditio978-3-540-73436-9978-3-540-73437-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: ovation 時間: 2025-3-23 07:37 作者: 粗俗人 時間: 2025-3-23 13:11 作者: 身體萌芽 時間: 2025-3-23 15:01
Justin King-Lacroix,Andrew Martins called structured motif, is composed two motif words on single nucleotide alphabet and with fixed spacers between them. We present an efficient algorithm to calculate the exact occurrence probability of a structured motif on a given sequence. It is the first non-trivial algorithm to calculate the exact p-value for such kind of motifs.作者: 仔細(xì)閱讀 時間: 2025-3-23 22:06
0302-9743 versity of Western Ontario, in London, Ontario, Canada from July 9 to 11, 2007. All the papers presented at the conference are original research contri- tions on computational pattern matching and analysis, data compression and compressed text processing, su?x arrays and trees, and computational bio作者: carotid-bruit 時間: 2025-3-23 22:54
Baris Yuce,Monjur Mourshed,Yacine Rezguie to the sum. In the shift-scale version, the objective is to compute . for all ., similarly. We show that the algorithms have the additional benefit of providing simple .(.log.) solutions for the problems of exact matching with don’t cares, exact shift matching with don’t cares and exact shift-scale matching with don’t cares.作者: Tinea-Capitis 時間: 2025-3-24 05:24
Cascading Failure Interaction Analysisg (RLE) of a text. For an .′-length RLE of an .-length text, we present a static structure that gives .(1) time . and .(loglog.) time . using .′log.?+?.(.) bits and a dynamic structure that provides . time operations in .′log.?+?.(.′log.)?+?.(.) bits.作者: Communicate 時間: 2025-3-24 06:51 作者: 迅速飛過 時間: 2025-3-24 12:19
Self-normalised Distance with Don’t Carese to the sum. In the shift-scale version, the objective is to compute . for all ., similarly. We show that the algorithms have the additional benefit of providing simple .(.log.) solutions for the problems of exact matching with don’t cares, exact shift matching with don’t cares and exact shift-scale matching with don’t cares.作者: 不能仁慈 時間: 2025-3-24 17:31
Dynamic Rank-Select Structures with Applications to Run-Length Encoded Textsg (RLE) of a text. For an .′-length RLE of an .-length text, we present a static structure that gives .(1) time . and .(loglog.) time . using .′log.?+?.(.) bits and a dynamic structure that provides . time operations in .′log.?+?.(.′log.)?+?.(.) bits.作者: Water-Brash 時間: 2025-3-24 19:38 作者: Decrepit 時間: 2025-3-25 02:43
Smart Grid Inspired Future Technologiessequence and . is its compression ratio (under each compression scheme). Our experimental results demonstrate that our new algorithms are indeed faster in practice. Furthermore, unlike Viterbi’s algorithm, our algorithms are highly parallelizable.作者: 臭了生氣 時間: 2025-3-25 03:28 作者: 失望昨天 時間: 2025-3-25 09:09
Cascading Failure Interaction Analysiss per disk access, for a disk page of 32 kilobytes. If we only need to . pattern occurrences, the space can be reduced to about 1.04–1.68 times the text size, requiring about 20–60 disk accesses, depending on the pattern length.作者: euphoria 時間: 2025-3-25 15:34
https://doi.org/10.1007/978-3-642-38030-3um (blockless) mosaic problem, and a practical algorithm for the general case. Experiments with our method show that it is practical in a range of data much larger than could be handled by the algorithm described in [15].作者: Palliation 時間: 2025-3-25 19:47 作者: Gesture 時間: 2025-3-25 21:21
Finding Witnesses by Peelingng, which we then solve by a process which we call .. Using this general framework we obtain improved results for all of the above problems. We also show that our method also solves a couple of problems outside the pattern matching domain.作者: 現(xiàn)代 時間: 2025-3-26 01:22 作者: Alopecia-Areata 時間: 2025-3-26 05:19 作者: 杠桿支點 時間: 2025-3-26 12:12
Smart Grid Inspired Future Technologiesd delete-mins. As it turns out, implementing a full heap with all operations is not that simple. For the sake of completeness we propose a heap with full operations based on balanced indexing trees that supports the heap operations in optimal times.作者: 先驅(qū) 時間: 2025-3-26 16:16
Smart Grid Inspired Future Technologiesof our knowledge, this index is the first external-memory data structure that does not require . I/Os. The second index reduces the space to .((.log.)/.) disk pages, and the I/O complexity is .((|.|?+?.)/.?+?log.. loglog.).作者: omnibus 時間: 2025-3-26 19:34
Privacy in Smart Metering Ecosystemsard, and we present a polynomial-time approximation scheme to solve it. To the best of our knowledge, this is the first approximation algorithm with a guarantee ratio for the protein structural motif problem.作者: mercenary 時間: 2025-3-27 00:13 作者: arrhythmic 時間: 2025-3-27 03:28 作者: nascent 時間: 2025-3-27 08:33 作者: NUDGE 時間: 2025-3-27 10:23
Conference proceedings 2007 Western Ontario, in London, Ontario, Canada from July 9 to 11, 2007. All the papers presented at the conference are original research contri- tions on computational pattern matching and analysis, data compression and compressed text processing, su?x arrays and trees, and computational biology. They作者: 樹木心 時間: 2025-3-27 16:21
A New and Faster Method of Sorting by Transpositions While there does exist better algorithms with regards to distance approximation, our approach relies on a simpler structure which makes for a significantly faster computation time, while keeping an acceptable close approximation.作者: Notorious 時間: 2025-3-27 19:35 作者: 無法治愈 時間: 2025-3-27 22:51
https://doi.org/10.1007/978-3-540-73437-6Alphabet; DOM; Pattern Matching; Variable; algorithms; approximation; bioinformatics; coding and data compr作者: Flatus 時間: 2025-3-28 05:33 作者: 夸張 時間: 2025-3-28 06:23 作者: Offstage 時間: 2025-3-28 11:34
Eng Tseng Lau,Kok Keong Chai,Yue Chen selection. Further, we introduce modern versions of suffix sorting and their application to XML processing. The study of combinatorial aspects of strings continues to flourish, and we present several open problems with modern applications.作者: 里程碑 時間: 2025-3-28 17:33 作者: 不如屎殼郎 時間: 2025-3-28 20:07
Andrew Paverd,Andrew Martin,Ian Brown between them. Our contribution: For two streams with hamming distance bounded by . we show a sketch of size .(.log.) with .(log.) processing time per new element in the stream and how to restore all locations where the two streams differ in time linear in the sketch size. Probability of error is less than 1/..作者: genesis 時間: 2025-3-28 23:12
Stringology: Some Classic and Some Modern Problems selection. Further, we introduce modern versions of suffix sorting and their application to XML processing. The study of combinatorial aspects of strings continues to flourish, and we present several open problems with modern applications.作者: 名次后綴 時間: 2025-3-29 04:57 作者: 不可思議 時間: 2025-3-29 10:52
Improved Sketching of Hamming Distance with Error Correcting between them. Our contribution: For two streams with hamming distance bounded by . we show a sketch of size .(.log.) with .(log.) processing time per new element in the stream and how to restore all locations where the two streams differ in time linear in the sketch size. Probability of error is less than 1/..作者: GLEAN 時間: 2025-3-29 13:14 作者: 過去分詞 時間: 2025-3-29 16:26 作者: zonules 時間: 2025-3-29 23:24 作者: 低能兒 時間: 2025-3-30 02:30 作者: 上腭 時間: 2025-3-30 05:04 作者: AVOID 時間: 2025-3-30 12:05
Smart Grid Inspired Future Technologiest strings (and afterwards the next . etc.) This on-demand variant strongly resembles the search engine queries which give you the best .-ranked pages recurringly..We present a data structure that supports this in .(.) preprocessing time, and answers queries in .(log.) time. There is also a cost of .作者: 營養(yǎng) 時間: 2025-3-30 14:59
Smart Grid Inspired Future Technologiesthe pattern and the text. This problem is one of several string matching problems that ask to not only to find where the pattern matches the text, under different “match” definitions, but also to provide . to the match. Other such problems include: .-aligned ones?[4], .-witnesses, and .-mismatches?[作者: 迅速飛過 時間: 2025-3-30 17:43
Smart Grid Inspired Future Technologies we want to construct an index of . such that for any input pattern?., we can find all its .-error matches in . efficiently. This problem is well-studied in the internal-memory setting. Here, we extend some of these recent results to external-memory solutions, which are also cache-oblivious. Our fir作者: Trabeculoplasty 時間: 2025-3-30 21:39 作者: 責(zé)任 時間: 2025-3-31 04:44 作者: grandiose 時間: 2025-3-31 06:22
https://doi.org/10.1007/978-3-031-29290-3form. In this paper we analyze these techniques from the point of view of how effective they are in the task of compressing low-entropy strings, that is, strings which have many regularities and are therefore highly compressible. This is a non-trivial task since many compressors have non-constant ov作者: Nmda-Receptor 時間: 2025-3-31 11:05
Cascading Failure Interaction Analysis we define a new index for full-text searching on ., based on the Lempel-Ziv compression algorithm and requiring 8.?+?.(.log.) bits of space, where . denotes the .-th order empirical entropy of ., for any .?=?.(log.). Our experimental results show that our index is significantly smaller than any oth作者: Antarctic 時間: 2025-3-31 13:29 作者: 共棲 時間: 2025-3-31 21:08 作者: 間諜活動 時間: 2025-4-1 01:14 作者: Immortal 時間: 2025-4-1 03:49
Cascading Failure Interaction Analysiss needed to change a molecule into another. One such rearrangement is that of .. At this time, it is not known if a polynomial time algorithm exists to compute the exact transposition distance between two permutations. In this article, we present a new and faster method of sorting by transpositions.作者: Creditee 時間: 2025-4-1 08:55 作者: Legion 時間: 2025-4-1 11:39 作者: 高貴領(lǐng)導(dǎo) 時間: 2025-4-1 14:26
Justin King-Lacroix,Andrew Martine statistical significance of a motif. A main problem is how to calculate the occurrence probability of the motif on the random model of DNA sequence efficiently and accurately. In this paper, we are interested in a particular motif model which is useful in transcription process. This motif, which i作者: lanugo 時間: 2025-4-1 22:00 作者: 作嘔 時間: 2025-4-2 01:55
A Combinatorial Approach to Genome-Wide Ortholog Assignment: Beyond Sequence Similarity Searchassign orthologs based on the similarity between DNA or protein sequences may make erroneous assignments when sequence similarity does not clearly delineate the evolutionary relationship among genes of the same families. In this paper, we present a new approach to ortholog assignment that takes into
