作者: BRIDE 時(shí)間: 2025-3-21 21:10
https://doi.org/10.1007/3-540-44888-8Graph; Matching; Pattern Matching; bioinformatics; computer; data compression; genome; information; multimed作者: 憂傷 時(shí)間: 2025-3-22 03:55
978-3-540-40311-1Springer-Verlag Berlin Heidelberg 2003作者: adhesive 時(shí)間: 2025-3-22 07:29 作者: Vulnerable 時(shí)間: 2025-3-22 10:22
0302-9743 Overview: 978-3-540-40311-1978-3-540-44888-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Intrepid 時(shí)間: 2025-3-22 14:35
Jiaheng Xie,Zhu Zhang,Xiao Liu,Daniel Zengd space .(. log. .). Our result solves an open problem posed by Myers and Miller because it reduces the time complexity of their algorithm by a factor log. . / log log . and the space complexity by a factor log .. For . = 2 genomes, our algorithm takes .(. log .) time and .(.) space.作者: Intrepid 時(shí)間: 2025-3-22 20:01 作者: 四牛在彎曲 時(shí)間: 2025-3-23 00:59
Multiple Genome Alignment: Chaining Algorithms Revisited,d space .(. log. .). Our result solves an open problem posed by Myers and Miller because it reduces the time complexity of their algorithm by a factor log. . / log log . and the space complexity by a factor log .. For . = 2 genomes, our algorithm takes .(. log .) time and .(.) space.作者: hematuria 時(shí)間: 2025-3-23 05:19 作者: 自作多情 時(shí)間: 2025-3-23 06:17
Jiaheng Xie,Zhu Zhang,Xiao Liu,Daniel Zengd space .(. log. .). Our result solves an open problem posed by Myers and Miller because it reduces the time complexity of their algorithm by a factor log. . / log log . and the space complexity by a factor log .. For . = 2 genomes, our algorithm takes .(. log .) time and .(.) space.作者: osculate 時(shí)間: 2025-3-23 11:11
Juhua Wu,Zhenyi Zhao,Shunjun Jiang,Lei Tao prove an upper and lower bound on the number of such different possible rotated patterns. Subsequently, given an . × . array (pattern) and an . × . array (text) over some finite alphabet ., we present a new method yielding an .(. . . .) time algorithm for this problem.作者: Talkative 時(shí)間: 2025-3-23 17:29
Lei Chen,Xiao-Qian Ma,Wei Shangpeat units called variants. The evolution of minisatellites is realized by tandem duplication and tandem deletion of variants. Jeffrey et al. proposed a method to obtain the sequence of variants, called maps. Bérard and Rivals designed the first algorithm of comparison of two minisatellite maps unde作者: 天空 時(shí)間: 2025-3-23 21:20
Haowei Huang,Tao Jin,Jianmin Wangence alignment, we have developed such a model for representing the conservation between related DNA coding sequences. Our model includes positional dependencies and periodic rates of conservation, as well as regional deviations in overall conservation rate. We show that, for hidden Markov models in作者: PHAG 時(shí)間: 2025-3-24 01:57 作者: Nausea 時(shí)間: 2025-3-24 04:56 作者: 大量 時(shí)間: 2025-3-24 08:54
Lecture Notes in Computer Science was first introduced by ., and has recently received a lot of attention. In this paper, we deal with the restricted problem of reconstructing single copy duplication trees. We describe an exact and polynomial distance based algorithm for solving this problem, the parsimony version of which has prev作者: 很是迷惑 時(shí)間: 2025-3-24 11:56
Energy Harvesting on Human Bodies,ng matching algorithm of Chang and Marr. Our algorithm inherits the optimality and is also competitive in practice. We present a second algorithm that is linear time and handles higher difference ratios. We show experimentally that our algorithms are the fastest for intermediate difference ratios, a作者: 蛙鳴聲 時(shí)間: 2025-3-24 16:15 作者: 柔軟 時(shí)間: 2025-3-24 22:00
https://doi.org/10.1007/978-3-642-39844-5g, problem in all such efforts is the inference of large-scale SNP-haplotypes from raw genotype SNP data. This is called the Haplotype Inference (HI) problem. Abstractly, input to the HI problem is a set of . strings over a ternary alphabet. A solution is a set of at most 2. strings over the binary 作者: 踉蹌 時(shí)間: 2025-3-25 03:10
Xiao Liu,Jing Liu,Hsinchun Chenapproximation algorithms for sorting linear permutations are known (. and .). In this paper, we observe that the problem of sorting circular permutations by transpositions is equivalent to the problem of sorting linear permutations by transpositions. Hence, all algorithms for sorting linear permutat作者: 協(xié)議 時(shí)間: 2025-3-25 03:40 作者: Communicate 時(shí)間: 2025-3-25 10:09 作者: contradict 時(shí)間: 2025-3-25 13:50
Smart Health rechtsvertr?glich gestaltet also called suffix array, a data structure introduced by Manber and Myers that has numerous applications in pattern matching, string processing, and computational biology. Though the suffix tree of a string can be constructed in linear time and the sorted order of suffixes derived from it, a direct作者: 暗指 時(shí)間: 2025-3-25 19:01
Smart Health rechtsvertr?glich gestaltetism. We ran extensive experiments with them and compared them with various versions of earlier algorithms, e.g. different trie implementations of the Aho-Corasick algorithm. Our algorithms showed to be substantially faster than earlier solutions for sets of 1,000–100,000 patterns. The gain is due to作者: engender 時(shí)間: 2025-3-25 22:32 作者: quiet-sleep 時(shí)間: 2025-3-26 03:40
Intelligent Systems Reference Libraryhat . can be split into . pieces .=. ..... ., where each . . has an occurrence in some text track . and these partial occurrences retain the order. We study some variations of this minimum splitting problem, such as splittings with limited gaps and transposition invariance, and show how to use spars作者: 死亡 時(shí)間: 2025-3-26 07:27
https://doi.org/10.1007/978-981-16-5304-9ider the problem of alignment of two multiple alignments with SP-score and linear gap costs..When there is no gap opening cost, this problem can be solved using the well-known dynamic programming algorithm for two sequences by viewing each column in the multiple alignments as an element. However if 作者: Scleroderma 時(shí)間: 2025-3-26 12:00 作者: 厭惡 時(shí)間: 2025-3-26 15:53 作者: Microgram 時(shí)間: 2025-3-26 18:36 作者: 好開玩笑 時(shí)間: 2025-3-26 23:23 作者: 褻瀆 時(shí)間: 2025-3-27 04:50
Debjani Panda,Ratula Ray,Satya Ranjan Dashing stage that is executed once per common substring, and an .(.) time alignment stage that is executed once for each appearance of the common substring in each source string. The additional running time depends only on the length of the parts of the strings that are not in any common substring.作者: 不溶解 時(shí)間: 2025-3-27 08:35 作者: 膠水 時(shí)間: 2025-3-27 12:09
Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions,BLAST, and also substantially better than those of PatternHunter or WABA, both of which use spaced seeds. Our results offer the hope of improved gene finding due to fewer missed exons in DNA/DNA comparison, and more effective homology search in general, and may have applications outside of bioinformatics.作者: construct 時(shí)間: 2025-3-27 14:25 作者: critique 時(shí)間: 2025-3-27 18:07 作者: 漫不經(jīng)心 時(shí)間: 2025-3-27 23:20 作者: 松果 時(shí)間: 2025-3-28 05:38
Smart Health rechtsvertr?glich gestaltetAho-Corasick algorithm. Our algorithms showed to be substantially faster than earlier solutions for sets of 1,000–100,000 patterns. The gain is due to the improved filtering efficiency caused by .-grams.作者: Limited 時(shí)間: 2025-3-28 08:04
Intelligent Systems Reference Library study some variations of this minimum splitting problem, such as splittings with limited gaps and transposition invariance, and show how to use sparse dynamic programming to solve the variations efficiently. In particular, we show that the minimum splitting problem can be interpreted as a shortest path problem on line segments.作者: 征稅 時(shí)間: 2025-3-28 11:52 作者: Incorporate 時(shí)間: 2025-3-28 18:29
On Minimizing Pattern Splitting in Multi-track String Matching, study some variations of this minimum splitting problem, such as splittings with limited gaps and transposition invariance, and show how to use sparse dynamic programming to solve the variations efficiently. In particular, we show that the minimum splitting problem can be interpreted as a shortest path problem on line segments.作者: BET 時(shí)間: 2025-3-28 21:33
Fast Lightweight Suffix Array Construction and Checking,thm is to first sort a sample of suffixes chosen using mathematical constructs called difference covers. The algorithm is not only lightweight but also fast in practice as demonstrated by experiments. Additionally, we describe fast and lightweight suffix array checkers, i.e., algorithms that check the correctness of a suffix array.作者: 不溶解 時(shí)間: 2025-3-29 00:57
Linear-Time Construction of Suffix Arrays,ix trees as intermediate data structures during its construction. Since the case of a constant-size alphabet can be subsumed in that of an integer alphabet, our result implies that the time complexity of directly constructing suffix arrays matches that of constructing suffix trees.作者: 虛度 時(shí)間: 2025-3-29 07:06
Lei Chen,Xiao-Qian Ma,Wei Shangime and .(. .) in space where . is the size of the maps. In this paper we propose a more efficient algorithm using the same evolutionary model which is .(. .) in time and .(. .) in space. Our algorithm with this better efficiency can even solve generalized and more refined models.作者: circumvent 時(shí)間: 2025-3-29 07:59 作者: 功多汁水 時(shí)間: 2025-3-29 14:46 作者: 修正案 時(shí)間: 2025-3-29 16:30
Xiao Liu,Jing Liu,Hsinchun Chenthan the previous ones, and achieves running time which is equal to the best known. Moreover, the analysis of the algorithm is significantly less involved, and provides a good starting point for studying related open problems.作者: Ornithologist 時(shí)間: 2025-3-29 23:16
Smart Health rechtsvertr?glich gestaltetithm for suffix sorting, which takes .(. log .) time. We also show how to construct suffix trees in linear time from our suffix sorting result. Apart from being simple and applicable for alphabets not necessarily of fixed size, this method of constructing suffix trees is more space efficient.作者: THROB 時(shí)間: 2025-3-30 01:13 作者: 點(diǎn)燃 時(shí)間: 2025-3-30 05:11 作者: 雄辯 時(shí)間: 2025-3-30 09:45
Average-Optimal Multiple Approximate String Matching,erns, being effective for hundreds of patterns. Hence we fill an important gap in approximate string matching techniques, since no effective algorithms existed to search for many patterns with an intermediate difference ratio.作者: ethereal 時(shí)間: 2025-3-30 12:38 作者: prediabetes 時(shí)間: 2025-3-30 17:39
Space Efficient Linear Time Construction of Suffix Arrays,ithm for suffix sorting, which takes .(. log .) time. We also show how to construct suffix trees in linear time from our suffix sorting result. Apart from being simple and applicable for alphabets not necessarily of fixed size, this method of constructing suffix trees is more space efficient.作者: Spongy-Bone 時(shí)間: 2025-3-30 21:34 作者: 富足女人 時(shí)間: 2025-3-31 04:05 作者: ear-canal 時(shí)間: 2025-3-31 08:39
Multiple Genome Alignment: Chaining Algorithms Revisited,d space .(. log. .). Our result solves an open problem posed by Myers and Miller because it reduces the time complexity of their algorithm by a factor log. . / log log . and the space complexity by a factor log .. For . = 2 genomes, our algorithm takes .(. log .) time and .(.) space.作者: Exhilarate 時(shí)間: 2025-3-31 13:15
Two-Dimensional Pattern Matching with Rotations, prove an upper and lower bound on the number of such different possible rotated patterns. Subsequently, given an . × . array (pattern) and an . × . array (text) over some finite alphabet ., we present a new method yielding an .(. . . .) time algorithm for this problem.作者: 壓艙物 時(shí)間: 2025-3-31 15:36
