Titlebook: Combinatorial Pattern Matching; 21st Annual Symposiu Amihood Amir,Laxmi Parida Conference proceedings 2010 Springer-Verlag Berlin Heidelber

责问

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

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

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

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

gorgeous

固执点好

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

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

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.

折磨

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.