作者: jocular 時(shí)間: 2025-3-21 23:38
Episode matching,ntain episode . as a subsequence. The respective optimization problem is to find the smallest number ., s.t. text . has a subword of length . which contains episode ...In this paper, we introduce a few efficient off-line as well as on-line algorithms for the entire problem, where by on-line algorith作者: 類似思想 時(shí)間: 2025-3-22 00:45 作者: Creditee 時(shí)間: 2025-3-22 05:24
On the complexity of pattern matching for highly compressed two-dimensional texts,ub-texts are defined in terms of smaller parts in a way similar to that of Lempel-Ziv compression for 1-dimensional texts, or in shortly described strings as in [9], or in hierarchical graphs described by context-free graph grammars. A given 2d-text . with many internal repetitions can have a hierar作者: 抵押貸款 時(shí)間: 2025-3-22 09:33 作者: Spirometry 時(shí)間: 2025-3-22 16:54 作者: Spirometry 時(shí)間: 2025-3-22 18:14
External inverse pattern matching,oal is to find a pattern . ∈ .. which is not a subword of . and which maximizes the sum of Hamming distances between . and all subwords of . of length .. We present an optimal . log σ)-time (where σ=∣Σ∣) algorithm for the external inverse pattern matching problem. This substantially improves the . l作者: 打擊 時(shí)間: 2025-3-22 22:03 作者: 盤旋 時(shí)間: 2025-3-23 04:49
A filter method for the weighted local similarity search problem,. of a pattern and subwords of a text whose lengths exceed a certain threshold. Moreover, arbitrary gap and substitution weights are allowed. In this paper, two new prefilter algorithms for the weighted local similarity search problem are presented. These overcome the disadvantages of a similar filt作者: 擁護(hù)者 時(shí)間: 2025-3-23 05:46 作者: Infinitesimal 時(shí)間: 2025-3-23 10:15
Flexible identification of structural objects in nucleic acid sequences: Palindromes, mirror repeatseudoknots and triple helices. We further explore here the idea of a model against which the words in a sequence are compared for finding these structural objects [17]. In the present case, models are words defined over the alphabet of nucleotides that have both direct and inverse occurrences in the作者: OCTO 時(shí)間: 2025-3-23 14:08
Banishing bias from consensus sequences,them. One such procedure is particularly effective in finding new, distant members of a given family of related sequences: start with a multiple alignment of the given members of the family and use an integral or fractional consensus sequence derived from the alignment to further probe the database.作者: Eclampsia 時(shí)間: 2025-3-23 21:34
Efficient algorithms for approximate string matching with swaps,for the extended .-differences problem. That is, we add swaps into the set of edit operations without increasing the time complexities of previous algorithms that consider only changes, deletions, and insertions for the edit distance and .-differences problems.作者: 母豬 時(shí)間: 2025-3-24 00:27 作者: prostate-gland 時(shí)間: 2025-3-24 04:36 作者: 為現(xiàn)場(chǎng) 時(shí)間: 2025-3-24 08:01 作者: 我們的面粉 時(shí)間: 2025-3-24 13:22 作者: exclamation 時(shí)間: 2025-3-24 16:45 作者: 腐爛 時(shí)間: 2025-3-24 20:39 作者: 哥哥噴涌而出 時(shí)間: 2025-3-25 02:14 作者: 搬運(yùn)工 時(shí)間: 2025-3-25 06:52 作者: Breach 時(shí)間: 2025-3-25 11:18 作者: 典型 時(shí)間: 2025-3-25 12:32
Trie-based data structures for sequence assembly,ogramming, and have improved the speed of overlap detection up to 1,000 times with high accuracy in our collaborative DNA sequencing with Brookhaven National Laboratory. We also studied the problem of approximating maximum space savings in tries structures for . in logic programming, which is proved to be hard.作者: 改變 時(shí)間: 2025-3-25 15:56 作者: 帶來(lái)的感覺(jué) 時(shí)間: 2025-3-25 20:48
Smart Electromechanical Systemstext size on each processor (i.e., text size . divided by ., the number of processors). This is faster than the best known sequential algorithm and improves over previous parallel algorithms to build suffix arrays, both in time complexity and scaling factor.作者: 新娘 時(shí)間: 2025-3-26 03:14
An improved pattern matching algorithm for strings in terms of straight-line programs,outputs a compact representation of all occurrences of . in .. This is superior to the algorithm proposed by Karpinski .. [11], which runs in .. log (.)) time using .).) space, and finds only one occurrence. Moreover, our algorithm is much simpler than theirs.作者: CESS 時(shí)間: 2025-3-26 06:44
Distributed generation of suffix arrays,text size on each processor (i.e., text size . divided by ., the number of processors). This is faster than the best known sequential algorithm and improves over previous parallel algorithms to build suffix arrays, both in time complexity and scaling factor.作者: 繁榮中國(guó) 時(shí)間: 2025-3-26 09:29 作者: GET 時(shí)間: 2025-3-26 12:57 作者: Modicum 時(shí)間: 2025-3-26 19:24
Direct construction of compact directed acyclic word graphs,作者: verdict 時(shí)間: 2025-3-26 21:29
Approximation algorithms for the fixed-topology phylogenetic number problem,作者: opportune 時(shí)間: 2025-3-27 01:07 作者: FIS 時(shí)間: 2025-3-27 09:17 作者: 能得到 時(shí)間: 2025-3-27 12:27
Aligning coding DNA in the presence of frame-shift errors,作者: Abutment 時(shí)間: 2025-3-27 16:19
Episode matching,de-off, i.e., it works in time . log log ./log(.)) when additional space is limited to .. Finally, we present two approximation algorithms for the optimization problem. The off-line algorithm is alphabet independent, it has superlinear time complexity .loglog(.)) and it uses only constant space. The作者: Entropion 時(shí)間: 2025-3-27 19:14
On the complexity of pattern matching for highly compressed two-dimensional texts,compressed pattern-matching, where the input consists of hierarchical descriptions of both the pattern . and the text .. For 1-dimensional strings there exist polynomial-time deterministic algorithms for these problems, for similar types of succinct text descriptions [2, 6, 8, 9]. We show that the c作者: RECUR 時(shí)間: 2025-3-27 22:09 作者: Keratin 時(shí)間: 2025-3-28 02:57 作者: 護(hù)航艦 時(shí)間: 2025-3-28 06:35 作者: shrill 時(shí)間: 2025-3-28 12:43 作者: Inferior 時(shí)間: 2025-3-28 16:50
Sensor Fusion and Measurement Errorse done in . time where . is the length of the sequence. The time complexity for the searching phase (that is, before the structural parts are put together at the end) of both algorithms presented here (one for palindromes and mirror repeats, the other for pseudoknots and triple helices) is then .(.(作者: 災(zāi)禍 時(shí)間: 2025-3-28 21:44
https://doi.org/10.1007/978-3-030-68172-2 of the sequences in the family. We call such fractional consensus sequences .. On the other hand, when only regular sequences can be used in the search, we propose that the consensus sequence have minimum maximum distance from any sequence in the family to avoid bias. Such sequences are NP-hard to 作者: subacute 時(shí)間: 2025-3-29 01:50 作者: anniversary 時(shí)間: 2025-3-29 03:34 作者: 沙漠 時(shí)間: 2025-3-29 09:56
Identification of Dynamics of Modules SEMSnsertions. In this paper we include the . operation that interchanges two adjacent characters into the set of allowable edit operations, and we present an . min(.))-time algorithm for the extended edit distance problem, where . is the edit distance between the given strings, and an .-time algorithm 作者: arrogant 時(shí)間: 2025-3-29 13:36 作者: 性滿足 時(shí)間: 2025-3-29 15:33 作者: 匍匐前進(jìn) 時(shí)間: 2025-3-29 21:10
Studies in Systems, Decision and Controlapped around the word: the tail protruding from the right end of the word reappears at the left end. Two weak circular squares are . if they have the same length and contain the same number of ones. We prove that the longest word with only . inequivalent weak circular squares contains 4.+2 bits and 作者: 2否定 時(shí)間: 2025-3-30 00:55 作者: FIS 時(shí)間: 2025-3-30 04:33
Smart Electromechanical Systems which execute in parallel and exchange messages among them. The underlying architecture is that of a high bandwidth network of processors. Our algorithm builds the suffix array by quickly assigning an independent subproblem to each processor and completing the process with a final local sorting. We作者: 詞根詞綴法 時(shí)間: 2025-3-30 09:51
Andrey E. Gorodetskiy,Irina L. Tarasova. of a pattern and subwords of a text whose lengths exceed a certain threshold. Moreover, arbitrary gap and substitution weights are allowed. In this paper, two new prefilter algorithms for the weighted local similarity search problem are presented. These overcome the disadvantages of a similar filt作者: Audiometry 時(shí)間: 2025-3-30 14:17 作者: congenial 時(shí)間: 2025-3-30 20:17 作者: BIPED 時(shí)間: 2025-3-31 00:30 作者: placebo-effect 時(shí)間: 2025-3-31 03:14
https://doi.org/10.1007/3-540-63220-4combinatorial structures; data compression; information retrieval; molecular biology; pattern matching; p作者: diathermy 時(shí)間: 2025-3-31 06:56 作者: 挑剔為人 時(shí)間: 2025-3-31 12:47 作者: 悄悄移動(dòng) 時(shí)間: 2025-3-31 17:24 作者: 公式 時(shí)間: 2025-3-31 20:32 作者: Lacerate 時(shí)間: 2025-3-31 23:20 作者: 獨(dú)特性 時(shí)間: 2025-4-1 05:44 作者: MAL 時(shí)間: 2025-4-1 06:04
Combinatorial Pattern Matching978-3-540-69214-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 毀壞 時(shí)間: 2025-4-1 13:19
Smart Electromechanical Systemsthan for conventional Huffman trees, .(log..) for trees of depth .(log .), and decoding is faster, because a part of the bit-comparisons necessary for the decoding may be saved. Empirical results on large real-life distributions show a reduction of up to 50% and more in the number of bit operations.作者: facetious 時(shí)間: 2025-4-1 17:04
Andrey E. Gorodetskiy,Irina L. Tarasova. of a pattern and subwords of a text whose lengths exceed a certain threshold. Moreover, arbitrary gap and substitution weights are allowed. In this paper, two new prefilter algorithms for the weighted local similarity search problem are presented. These overcome the disadvantages of a similar filter algorithm devised by Myers.
