Combinatorial Pattern Matching [electronic resource] :15th Annual Symposium, CPM 2004, Istanbul, Turkey, July 5-7, 2004. Proceedings /
Contributor(s): Sahinalp, Suleyman Cenk [editor.] | Muthukrishnan, S [editor.] | Dogrusoz, Ugur [editor.] | SpringerLink (Online service).Material type: BookSeries: Lecture Notes in Computer Science: 3109Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2004.Description: XII, 492 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540278016.Subject(s): Computer science | Data structures (Computer science) | Algorithms | Computer science -- Mathematics | Information storage and retrieval | Text processing (Computer science) | Pattern recognition | Computer Science | Pattern Recognition | Algorithm Analysis and Problem Complexity | Data Structures | Discrete Mathematics in Computer Science | Information Storage and Retrieval | Document Preparation and Text ProcessingOnline resources: Click here to access online
Sorting by Reversals in Subquadratic Time -- Computational Problems in Perfect Phylogeny Haplotyping: Xor-Genotypes and Tag SNPs -- Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity -- Optimizing Multiple Spaced Seeds for Homology Search -- Approximate Labelled Subtree Homeomorphism -- On the Average Sequence Complexity -- Approximate Point Set Pattern Matching on Sequences and Planes -- Finding Biclusters by Random Projections -- Real-Time String Matching in Sublinear Space -- On the k-Closest Substring and k-Consensus Pattern Problems -- A Trie-Based Approach for Compacting Automata -- A Simple Optimal Representation for Balanced Parentheses -- Two Algorithms for LCS Consecutive Suffix Alignment -- Efficient Algorithms for Finding Submasses in Weighted Strings -- Maximum Agreement and Compatible Supertrees -- Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem -- Small Phylogeny Problem: Character Evolution Trees -- The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices -- A Computational Model for RNA Multiple Structural Alignment -- Computational Design of New and Recombinant Selenoproteins -- A Combinatorial Shape Matching Algorithm for Rigid Protein Docking -- Multi-seed Lossless Filtration -- New Results for the 2-Interval Pattern Problem -- A Linear-Time Algorithm for Computing Translocation Distance between Signed Genomes -- Sparse Normalized Local Alignment -- Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences -- Maximal Common Connected Sets of Interval Graphs -- Performing Local Similarity Searches with Variable Length Seeds -- Reversal Distance without Hurdles and Fortresses -- A Fast Set Intersection Algorithm for Sorted Sequences -- Faster Two Dimensional Pattern Matching with Rotations -- Compressed Compact Suffix Arrays -- Approximate String Matching Using Compressed Suffix Arrays -- Compressed Index for a Dynamic Collection of Texts -- Improved Single and Multiple Approximate String Matching -- Average-Case Analysis of Approximate Trie Search.