作者: Malcontent 時(shí)間: 2025-3-21 22:57
Affine Image Matching Is Uniform ,-Complete,arch in combinatorial pattern matching led to a polynomial time algorithm which solves this problem by a sophisticated search in the set . of all affine transformations of .. This paper shows that polynomial time is not the lowest complexity class containing this problem by providing its .-completen作者: 謙虛的人 時(shí)間: 2025-3-22 04:12
Old and New in Stringology, of the talk will revisit the list. Some problems were solved, others were partially solved and some resisted any progress..The second part of the talk will review some recent results in Stringology, namely algorithms in the streaming model. In this model, the algorithms cannot store the entire inpu作者: 同步信息 時(shí)間: 2025-3-22 07:38
Small-Space 2D Compressed Dictionary Matching,ssed form. In this paper we introduce the 2-dimensional compressed dictionary matching problem in Lempel-Ziv compressed images, and present an efficient solution for patterns whose rows are all .. Given . patterns, each of (uncompressed) size . ×., and a text of (uncompressed) size . ×., all in 2D-L作者: 江湖騙子 時(shí)間: 2025-3-22 08:44
Bidirectional Search in a String with Wavelet Trees,e) is highly conserved, the genes encoding it can be determined by finding regions in a genomic DNA sequence that match the structure. It is known that algorithms using a bidirectional search on the DNA sequence for this task outperform algorithms based on unidirectional search. The data structures 作者: 惰性氣體 時(shí)間: 2025-3-22 13:53
A Minimal Periods Algorithm with Applications, in a word. Using the same construction of suffix trees, we generalize his result and describe in detail how to compute the minimal . power, with a period of length longer than ., starting at each position in a word . for arbitrary exponent .>?1 and integer .?≥?0. The algorithm runs in .(.|.|)-time 作者: 惰性氣體 時(shí)間: 2025-3-22 18:41
The Property Suffix Tree with Dynamic Properties,phabet Σ (which we assume is of constant size), and a set of intervals . over the text positions, such that give a query pattern . of size . we can report all of the occurrences of . in . which are completely contained within some interval from .. This type of matching is extremely helpful in scenar作者: 推崇 時(shí)間: 2025-3-22 23:38 作者: Banquet 時(shí)間: 2025-3-23 03:44 作者: 有機(jī)體 時(shí)間: 2025-3-23 08:46
On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs,melin, Rosamond, and Vialette. We also give an FPT algorithm for .. in .-interval graphs, parameterized by both . and ., with running time max { .., 2. } ·poly(.), where . is the number of vertices in the graph. This slightly improves the previous FPT algorithm by Fellows, Hermelin, Rosamond, and Vi作者: 歹徒 時(shí)間: 2025-3-23 12:52
Succinct Representations of Separable Graphs,hmic word size. In particular, we show constant-time support for adjacency, degree and neighborhood queries. For any monotone class of separable graphs, the storage requirement of the representation is optimal to within lower order terms..Separable graphs are those that admit a .(..)-separator theor作者: 火海 時(shí)間: 2025-3-23 14:08 作者: 雪上輕舟飛過 時(shí)間: 2025-3-23 19:22 作者: 晚間 時(shí)間: 2025-3-23 22:56
The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection,several limitations of the Viterbi decoding have been demonstrated, and new algorithms have been developed to address them (Kall et al., 2005; Brejova et al., 2007; Gross et al., 2007; Brown and Truszkowski, 2010). In this paper, we propose a new efficient highest expected reward decoding algorithm 作者: 持續(xù) 時(shí)間: 2025-3-24 03:59
,Phylogeny- and Parsimony-Based Haplotype?Inference?with?Constraints,aplotyping method is based on an evolutionary model where a perfect phylogenetic tree is sought that explains the observed data. In their .?2009 paper, Fellows et al. studied an extension of this approach that incorporates prior knowledge in the form of a set of candidate haplotypes from which the r作者: 華而不實(shí) 時(shí)間: 2025-3-24 08:53
Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks,works. Given two networks ..,.. with . leaves, . nodes, and . edges, the Robinson-Foulds distance measures the number of clusters of descendant leaves that are not shared by .. and ... The fastest known algorithm for computing the Robinson-Foulds distance between those networks runs in .(.(.?+?.)) t作者: 洞察力 時(shí)間: 2025-3-24 13:15
Mod/Resc Parsimony Inference,pulate natural insect populations infected by inherited, intra-cellular parasitic bacteria. In this problem, that we denote by ., we are given a boolean matrix and the goal is to find two other boolean matrices with a minimum number of columns such that an appropriately defined operation on these ma作者: Rinne-Test 時(shí)間: 2025-3-24 16:25 作者: 有偏見 時(shí)間: 2025-3-24 20:26 作者: 懸掛 時(shí)間: 2025-3-25 03:04 作者: 責(zé)問 時(shí)間: 2025-3-25 03:51
https://doi.org/10.1007/978-3-319-19875-0rmal problem . might be NP-complete. In the present paper we present a polynomial-time algorithm for it. Our algorithmic ideas also yield new fixed-parameter algorithms for related haplotyping problems based on the maximum parsimony assumption.作者: cravat 時(shí)間: 2025-3-25 09:32
Smart Education and Smart e-Learningquivalence. We provide a new, fixed-parameter tractability approach for solving both that slightly improves upon a previously published algorithm for the .. Finally, we present experimental results where we applied some of our techniques to a real-life data set.作者: Adenoma 時(shí)間: 2025-3-25 13:38
Bidirectional Search in a String with Wavelet Trees,present a new data structure called . that supports bidirectional search with much less space. With this data structure, it is possible to search for RNA secondary structural patterns in large genomes, for example the human genome.作者: BRINK 時(shí)間: 2025-3-25 16:55
Pseudo-realtime Pattern Matching: Closing the Gap,proves these complexities to .(.) time for the .-difference problem and . for the .-mismatch problem. In the process of developing the main results, we also give a simple solution with optimal time complexity for performing longest common extension queries in the same pseudo-realtime setting which may be of independent interest.作者: obstruct 時(shí)間: 2025-3-25 23:43 作者: gorgeous 時(shí)間: 2025-3-26 00:40 作者: 固執(zhí)點(diǎn)好 時(shí)間: 2025-3-26 08:23
Mod/Resc Parsimony Inference,quivalence. We provide a new, fixed-parameter tractability approach for solving both that slightly improves upon a previously published algorithm for the .. Finally, we present experimental results where we applied some of our techniques to a real-life data set.作者: Additive 時(shí)間: 2025-3-26 11:35
Baobei Peng,Xiulan Huang,Yanjun Shilinear programming. We also show that a weaker version of the . bound is also more accurate than the existing bound, and can be computed in polynomial time. Simulation shows that the new bounds often match the exact optimum at least for the range of data we tested. Moreover, we give an analytical upper bound for the minimum mosaic problem.作者: hypnotic 時(shí)間: 2025-3-26 14:02
Haijun Zeng,Jiahao Liu,Lijie Yue et al., 2007; Gross et al., 2007; Brown and Truszkowski, 2010). In this paper, we propose a new efficient highest expected reward decoding algorithm (HERD) that allows for uncertainty in boundaries of individual sequence features. We demonstrate usefulness of our approach on jumping HMMs for recombination detection in viral genomes.作者: 折磨 時(shí)間: 2025-3-26 19:06
Bounds on the Minimum Mosaic of Population Sequences under Recombination,linear programming. We also show that a weaker version of the . bound is also more accurate than the existing bound, and can be computed in polynomial time. Simulation shows that the new bounds often match the exact optimum at least for the range of data we tested. Moreover, we give an analytical upper bound for the minimum mosaic problem.作者: Friction 時(shí)間: 2025-3-26 21:28 作者: 啤酒 時(shí)間: 2025-3-27 05:00
Ramesh K. Singh,Shreyes N. Melkotehing problem for two types of sub-forests: closed subforests and closed substructures. As RNA molecules’ secondary structures could be represented as ordered labelled forests, our algorithms can be used to locate the structural or functional regions in RNA secondary structures.作者: 送秋波 時(shí)間: 2025-3-27 05:32
https://doi.org/10.1007/978-3-031-27926-3ess. This result means not only that there are extremely efficient parallel solutions but also reveals further insight into the structural properties of image matching. The completeness in . relates affine image matching to a number of most basic problems in computer science, like integer multiplication and division.作者: 試驗(yàn) 時(shí)間: 2025-3-27 12:20 作者: CLAY 時(shí)間: 2025-3-27 15:45
Femi Olokesusi,Femi Ola Aiyegbajejefor .?=?0 and in .(|.|.)-time otherwise. We provide a complete proof of the correctness and computational complexity of the algorithm. The algorithm can be used to detect certain types of pseudo-patterns in words, which was our original goal in studying this generalization.作者: 一個(gè)姐姐 時(shí)間: 2025-3-27 19:12 作者: Dignant 時(shí)間: 2025-3-27 23:52 作者: 有組織 時(shí)間: 2025-3-28 05:22
Old and New in Stringology,t string(s) and can use only very limited space. Surprisingly, efficient algorithms were discovered for a number of string problems..The talk will conclude with new open problems that are raised by these new results.作者: Dislocation 時(shí)間: 2025-3-28 08:23 作者: 無聊點(diǎn)好 時(shí)間: 2025-3-28 13:26 作者: 宣誓書 時(shí)間: 2025-3-28 18:21 作者: Disk199 時(shí)間: 2025-3-28 22:35
Juanying Zhang,Xiong Xu,Yan Hu,Yuanyuan Liet problems. Our interest is in the number of oracle queries required to find an optimal hitting set. After presenting some generic algorithms for this problem we focus on our computational experience with an implicit hitting set problem related to multi-genome alignment in genomics. This is joint work with Erick Moreno Centeno.作者: constellation 時(shí)間: 2025-3-29 01:03
Smart Study: Pen and Paper-Based E-Learningimum spread of a phylogenetic network and show how the running time of our new algorithm depends on this parameter. As an example, we prove that the minimum spread of a level-. phylogenetic network is at most .?+?1, which implies that for two level-. phylogenetic networks, our algorithm runs in .((.?+?1)(.?+?.)) time.作者: WATER 時(shí)間: 2025-3-29 03:19 作者: 悠然 時(shí)間: 2025-3-29 10:24 作者: 倔強(qiáng)一點(diǎn) 時(shí)間: 2025-3-29 15:15 作者: 商店街 時(shí)間: 2025-3-29 17:55 作者: 和諧 時(shí)間: 2025-3-29 22:06 作者: Indicative 時(shí)間: 2025-3-30 01:53 作者: 音樂等 時(shí)間: 2025-3-30 06:30
T. M. Vinod Kumar,Bharat Dahiyadynamic version where intervals may be inserted or deleted to or from ., or batched insertions where a set of intervals is inserted into .. In particular, the batched version provides us with a new (optimal) algorithm for the static case.作者: 謙卑 時(shí)間: 2025-3-30 12:14 作者: aquatic 時(shí)間: 2025-3-30 13:15
Ramesh K. Singh,Shreyes N. Melkotelled trees. Given an ordered labelled forest . (“the target forest”) and an ordered labelled forest . (“the pattern forest”), the . is to find a sub-forest .′ of . such that .′ and . are the most similar over all possible .′. In this paper, we present efficient algorithms for the forest pattern matc作者: Paraplegia 時(shí)間: 2025-3-30 17:00 作者: GORGE 時(shí)間: 2025-3-30 21:47
Smart Digital Service Ecosystems of the talk will revisit the list. Some problems were solved, others were partially solved and some resisted any progress..The second part of the talk will review some recent results in Stringology, namely algorithms in the streaming model. In this model, the algorithms cannot store the entire inpu作者: 分散 時(shí)間: 2025-3-31 04:38 作者: 看法等 時(shí)間: 2025-3-31 05:18 作者: Parley 時(shí)間: 2025-3-31 10:53
Femi Olokesusi,Femi Ola Aiyegbajeje in a word. Using the same construction of suffix trees, we generalize his result and describe in detail how to compute the minimal . power, with a period of length longer than ., starting at each position in a word . for arbitrary exponent .>?1 and integer .?≥?0. The algorithm runs in .(.|.|)-time 作者: Exonerate 時(shí)間: 2025-3-31 16:23
T. M. Vinod Kumar,Bharat Dahiyaphabet Σ (which we assume is of constant size), and a set of intervals . over the text positions, such that give a query pattern . of size . we can report all of the occurrences of . in . which are completely contained within some interval from .. This type of matching is extremely helpful in scenar作者: PRE 時(shí)間: 2025-3-31 17:35 作者: escalate 時(shí)間: 2025-3-31 22:03
https://doi.org/10.1007/978-981-10-1610-3 arriving character and unamortised. The well-known .-difference/.-mismatch problems are those of finding all alignments of a pattern of length . with a text of length . where the edit/Hamming distance is at most .. Offline, the literature gives efficient solutions in .(.) and . time, respectively. 作者: FATAL 時(shí)間: 2025-4-1 02:31 作者: 美食家 時(shí)間: 2025-4-1 07:33
