Share on TelegramCombinatorial pattern matching : 15th annual symposium, CPM 2004, Istanbul, Turkey, July 5 7, 2004 : proceedin
Author: Sahinalp, Suleyman Cenk, Muthukrishnan, S, Dogrusoz, Ugur
Added by: sketch
Added Date: 2015-12-29
Language: eng
Subjects: Computer algorithms, Combinatorial analysis, Algorithme, Algoritmen, Analyse combinatoire, Appariement de forme, Combinatorische meetkunde, Matching, Patroonherkenning, Algorithmes, Analyse combinatoire, Combinatorial analysis, Computer algorithms, Combinatorische meetkunde, Matching, Algoritmen, Patroonherkenning, Algorithme, Analyse combinatoire, Appariement de forme, Mustervergleich, Mustervergleich
Publishers: Berlin ; New York : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 354022341X, 9783540223412
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 253.07 MB
PDF Size: 5.55 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 261
Views: 311
Total Files: 18
Media Type: texts
Total Files: 5
Last Modified: 2022-03-09 10:13:04
Size: 13.85 KB
Description
Author: Suleyman Cenk Sahinalp, S. Muthukrishnan, Ugur Dogrusoz
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-22341-2
DOI: 10.1007/b98377
Table of Contents:
- 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
Includes bibliographical references and author index
