Mehr zum Buch
Inhaltsverzeichnis covers various advanced topics in data structures, algorithms, and applications, particularly in molecular biology. The first section discusses asynchronous pattern matching and SNP analysis, focusing on co-referential names. The second section delves into indexing data structures, including a linear size index for approximate pattern matching and efficient suffix tree construction. Probabilistic and algebraic techniques are explored in the third section, presenting new bounds for motif finding and clustering methods. Applications in molecular biology are highlighted across multiple sessions, addressing challenges like phylogenetic tree reconstruction and subsequence combinatorics. The text also covers string matching techniques, including property and weighted matching, and RNA structural alignment, emphasizing polynomial-time algorithms for RNA pseudoknot structures. Further discussions include data compression strategies, such as Burrows-Wheeler based methods and dynamic entropy-compressed sequences. The final sections focus on string matching advancements, including algorithms for longest common increasing subsequences and text fingerprinting, alongside dynamic programming approaches for sequence alignment and matching. This comprehensive overview showcases significant theoretical and practical improvements in computational biology and data processing.
Buchkauf
Combinatorial pattern matching, Moshe Lewenstein
- Sprache
- Erscheinungsdatum
- 2006
- product-detail.submit-box.info.binding
- (Paperback)
Lieferung
Zahlungsmethoden
Keiner hat bisher bewertet.