Articoli correlati a Combinatorial Pattern Matching: 14th Annual Symposium,...

Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003, Morelia, Michoacán, Mexico, June 25-27, 2003, Proceedings - Brossura

 
9783662208335: Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003, Morelia, Michoacán, Mexico, June 25-27, 2003, Proceedings

Al momento non sono disponibili copie per questo codice ISBN.

Sinossi

Multiple Genome Alignment: Chaining Algorithms Revisited.- Two-Dimensional Pattern Matching with Rotations.- An Improved Algorithm for Generalized Comparison of Minisatellites.- Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions.- Fast Lightweight Suffix Array Construction and Checking.- Distributed and Paged Suffix Trees for Large Genetic Databases.- Analysis of Tree Edit Distance Algorithms.- An Exact and Polynomial Distance-Based Algorithm to Reconstruct Single Copy Tandem Duplication Trees.- Average-Optimal Multiple Approximate String Matching.- Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms.- Haplotype Inference by Pure Parsimony.- A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions.- Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals.- Linear-Time Construction of Suffix Arrays.- Space Efficient Linear Time Construction of Suffix Arrays.- Tuning String Matching for Huge Pattern Sets.- Sparse LCS Common Substring Alignment.- On Minimizing Pattern Splitting in Multi-track String Matching.- Alignment between Two Multiple Alignments.- An Effective Algorithm for the Peptide De Novo Sequencing from MS/MS Spectrum.- Pattern Discovery in RNA Secondary Structure Using Affix Trees.- More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs.- Complexities of the Centre and Median String Problems.- Extracting Approximate Patterns.- A Fully Linear-Time Approximation Algorithm for Grammar-Based Compression.- Constrained Tree Inclusion.- Working on the Problem of Sorting by Transpositions on Genome Rearrangements.- Efficient Selection of Unique and Popular Oligos for Large EST Databases.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

(nessuna copia disponibile)

Cerca:



Inserisci un desiderata

Non riesci a trovare il libro che stai cercando? Continueremo a cercarlo per te. Se uno dei nostri librai lo aggiunge ad AbeBooks, ti invieremo una notifica!

Inserisci un desiderata

Altre edizioni note dello stesso titolo

9783540403111: Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003, Morelia, Michoac¿¿n, Mexico, June 25-27, 2003, Proceedings: 2676

Edizione in evidenza

ISBN 10:  3540403116 ISBN 13:  9783540403111
Casa editrice: Springer, 2008
Brossura