Combinatorial pattern matching : 16th annual symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005 : proceedings / / Alberto Apostolico, Maxime Crochemore, Kunsoo Park (eds.) |
Edizione | [1st ed. 2005.] |
Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
Descrizione fisica | 1 online resource (XII, 452 p.) |
Disciplina | 511/.6 |
Altri autori (Persone) |
ApostolicoAlberto <1948->
CrochemoreMaxime <1947-> ParkKunsoo |
Collana | Lecture notes in computer science |
Soggetto topico |
Computer algorithms
Combinatorial analysis |
ISBN |
3-540-31562-4
3-540-26201-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern -- On the Longest Common Rigid Subsequence Problem -- Text Indexing with Errors -- A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space -- Succinct Suffix Arrays Based on Run-Length Encoding -- Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets -- Faster Algorithms for ?,?-Matching and Related Problems -- A Fast Algorithm for Approximate String Matching on Gene Sequences -- Approximate Matching in the L 1 Metric -- An Efficient Algorithm for Generating Super Condensed Neighborhoods -- The Median Problem for the Reversal Distance in Circular Bacterial Genomes -- Using PQ Trees for Comparative Genomics -- Hardness of Optimal Spaced Seed Design -- Weighted Directed Word Graph -- Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets -- An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression -- DNA Compression Challenge Revisited: A Dynamic Programming Approach -- On the Complexity of Sparse Exon Assembly -- An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery -- Incremental Inference of Relational Motifs with a Degenerate Alphabet -- Speeding up Parsing of Biological Context-Free Grammars -- A New Periodicity Lemma -- Two Dimensional Parameterized Matching -- An Optimal Algorithm for Online Square Detection -- A Simple Fast Hybrid Pattern-Matching Algorithm -- Prefix-Free Regular-Expression Matching -- Reducing the Size of NFAs by Using Equivalences and Preorders -- Regular Expression Constrained Sequence Alignment -- A Linear Tree Edit Distance Algorithm for Similar Ordered Trees -- A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables -- Assessing the Significance of Sets of Words -- Inferring a Graph from Path Frequency -- Exact and Approximation Algorithms for DNA Tag Set Design -- Parametric Analysis for Ungapped Markov Models of Evolution -- Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements -- Identifying Similar Surface Patches on Proteins Using a Spin-Image Surface Representation -- Mass Spectra Alignments and Their Significance. |
Altri titoli varianti | CPM 2005 |
Record Nr. | UNINA-9910483301103321 |
Berlin ; ; New York, : Springer, c2005 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Research in computational molecular biology : 10th annual international conference, RECOMB 2006, Venice, Italy, April 2-5, 2006 : proceedings / / Alberto Apostolico ... [et al.] (eds.) |
Edizione | [1st ed. 2006.] |
Pubbl/distr/stampa | Berlin, : Springer, c2006 |
Descrizione fisica | 1 online resource (XVIII, 614 p.) |
Disciplina | 572.8 |
Altri autori (Persone) | ApostolicoAlberto <1948-> |
Collana | Lecture notes in computer science. Lecture notes in bioinformatics |
Soggetto topico | Molecular biology - Computer simulation |
ISBN | 3-540-33296-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Integrated Protein Interaction Networks for 11 Microbes -- Hypergraph Model of Multi-residue Interactions in Proteins: Sequentially–Constrained Partitioning Algorithms for Optimization of Site-Directed Protein Recombination -- Biological Networks: Comparison, Conservation, and Evolutionary Trees -- Assessing Significance of Connectivity and Conservation in Protein Interaction Networks -- Clustering Short Gene Expression Profiles -- A Patient-Gene Model for Temporal Expression Profiles in Clinical Studies -- Global Interaction Networks Probed by Mass Spectrometry -- Statistical Evaluation of Genome Rearrangement -- An Improved Statistic for Detecting Over-Represented Gene Ontology Annotations in Gene Sets -- Protein Function Annotation Based on Ortholog Clusters Extracted from Incomplete Genomes Using Combinatorial Optimization -- Detecting MicroRNA Targets by Linking Sequence, MicroRNA and Gene Expression Data -- RNA Secondary Structure Prediction Via Energy Density Minimization -- Structural Alignment of Pseudoknotted RNA -- Stan Ulam and Computational Biology -- CONTRAlign: Discriminative Training for Protein Sequence Alignment -- Clustering Near-Identical Sequences for Fast Homology Search -- New Methods for Detecting Lineage-Specific Selection -- A Probabilistic Model for Gene Content Evolution with Duplication, Loss, and Horizontal Transfer -- A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric -- Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations -- Inferring Common Origins from mtDNA -- Efficient Enumeration of Phylogenetically Informative Substrings -- Phylogenetic Profiling of Insertions and Deletions in Vertebrate Genomes -- Maximal Accurate Forests from Distance Matrices -- Leveraging Information Across HLA Alleles/Supertypes Improves Epitope Prediction -- Improving Prediction of Zinc Binding Sites by Modeling the Linkage Between Residues Close in Sequence -- An Important Connection Between Network Motifs and Parsimony Models -- Ultraconserved Elements, Living Fossil Transposons, and Rapid Bursts of Change: Reconstructing the Uneven Evolutionary History of the Human Genome -- Permutation Filtering: A Novel Concept for Significance Analysis of Large-Scale Genomic Data -- Genome-Wide Discovery of Modulators of Transcriptional Interactions in Human B Lymphocytes -- A New Approach to Protein Identification -- Markov Methods for Hierarchical Coarse-Graining of Large Protein Dynamics -- Simulating Protein Motions with Rigidity Analysis -- Predicting Experimental Quantities in Protein Folding Kinetics Using Stochastic Roadmap Simulation -- An Outsider’s View of the Genome -- Alignment Statistics for Long-Range Correlated Genomic Sequences -- Simple and Fast Inverse Alignment -- Revealing the Proteome Complexity by Mass Spectrometry -- Motif Yggdrasil: Sampling from a Tree Mixture Model -- A Study of Accessible Motifs and RNA Folding Complexity -- A Parameterized Algorithm for Protein Structure Alignment -- Geometric Sieving: Automated Distributed Optimization of 3D Motifs for Protein Function Prediction -- A Branch-and-Reduce Algorithm for the Contact Map Overlap Problem -- A Novel Minimized Dead-End Elimination Criterion and Its Application to Protein Redesign in a Hybrid Scoring and Search Algorithm for Computing Partition Functions over Molecular Ensembles -- 10 Years of the International Conference on Research in Computational Molecular Biology (RECOMB) -- Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions -- A Parsimony Approach to Genome-Wide Ortholog Assignment -- Detecting the Dependent Evolution of Biosequences -- Detecting MicroRNA Targets by Linking Sequence, MicroRNA and Gene Expression Data. |
Altri titoli varianti | RECOMB 2006 |
Record Nr. | UNINA-9910484571303321 |
Berlin, : Springer, c2006 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|