Algorithms in bioinformatics : Second International Workshop, WABI 2002, Rome, Italy, September 17-21, 2002 : proceedings / Roderic Guigó, Dan Gusfield, ed.

Contributor(s): Guigó, Roderic, 1959- | Gusfield, Dan | WABI (Workshop) (2nd : 2002 : Rome, Italy)
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 2452.Publisher: Berlin ; New York : Springer, ©2002Description: 1 online resource (x, 554 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540457848; 3540457844Subject(s): Bioinformatics -- Congresses | Computer algorithms -- Congresses | Algorithms | Medical Informatics Computing | Computational Biology | Computing Methodologies | Mathematical Concepts | Medical Informatics | Biology | Biological Science Disciplines | Phenomena and Processes | Information Science | Natural Science Disciplines | Disciplines and Occupations | Algorithmes -- Congrès | Bio-informatique -- Congrès | Bioinformatics | Computer algorithms | Algorithmus | Approximationsalgorithmus | Berechnungskomplexität | Biocomputer | Bioinformatik | Evolutionärer Algorithmus | Kongress | Molekulargenetik | TEORIA DA COMPUTAÇÃO | ALGORITMOS E ESTRUTURAS DE DADOS | ANÁLISE NUMÉRICA | ANÁLISE DE ALGORITMOS | Rom (2002)Genre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:WABI 2002 (2002 : Rome, Italy): Algorithms in bioinformatics : Second International Workshop, WABI 2002, Rome, Italy, September 17-21, 2002 : proceedingsDDC classification: 572.8/0285 LOC classification: R858.A2 | A442 2002Other classification: 42.11 | BIO 110f | DAT 530f | SS 4800 Online resources: Click here to access online
Contents:
Simultaneous Relevant Feature Identification and Classification in High-Dimensional Spaces -- Pooled Genomic Indexing (PGI): Mathematical Analysis and Experiment Design -- Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem -- Methods for Inferring Block-Wise Ancestral History from Haploid Sequences -- Finding Signal Peptides in Human Protein Sequences Using Recurrent Neural Networks -- Generating Peptide Candidates from Amino-Acid Sequence Databases for Protein Identification via Mass Spectrometry -- Improved Approximation Algorithms for NMR Spectral Peak Assignment -- Efficient Methods for Inferring Tandem Duplication History -- Genome Rearrangement Phylogeny Using Weighbor -- Segment Match Refinement and Applications -- Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation -- Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics -- FAUST: An Algorithm for Extracting Functionally Relevant Templates from Protein Structures -- Efficient Unbound Docking of Rigid Molecules -- A Method of Consolidating and Combining EST and mRNA Alignments to a Genome to Enumerate Supported Splice Variants -- A Method to Improve the Performance of Translation Start Site Detection and Its Application for Gene Finding -- Comparative Methods for Gene Structure Prediction in Homologous Sequences -- MultiProt -- A Multiple Protein Structural Alignment Algorithm -- A Hybrid Scoring Function for Protein Multiple Alignment -- Functional Consequences in Metabolic Pathways from Phylogenetic Profiles -- Finding Founder Sequences from a Set of Recombinants -- Estimating the Deviation from a Molecular Clock -- Exploring the Set of All Minimal Sequences of Reversals -- An Application to Test the Replication-Directed Reversal Hypothesis -- Approximating the Expected Number of Inversions Given the Number of Breakpoints -- Invited Lecture -- Accelerating Smith-Waterman Searches -- Sequence-Length Requirements for Phylogenetic Methods -- Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle -- NeighborNet: An Agglomerative Method for the Construction of Planar Phylogenetic Networks -- On the Control of Hybridization Noise in DNA Sequencing-by-Hybridization -- Restricting SBH Ambiguity via Restriction Enzymes -- Invited Lecture -- Molecule as Computation: Towards an Abstraction of Biomolecular Systems -- Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search -- Rapid Large-Scale Oligonucleotide Selection for Microarrays -- Border Length Minimization in DNA Array Design* -- The Enhanced Suffix Array and Its Applications to Genome Analysis -- The Algorithmic of Gene Teams -- Combinatorial Use of Short Probes for Differential Gene Expression Profiling -- Designing Specific Oligonucleotide Probes for the Entire S. cerevisiae Transcriptome -- K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data -- Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data -- Modified Mincut Supertrees.
Summary: This book constitutes the refereed proceedings of the Second International Bioinformatics, WABI 2002, held in Rome, Italy, in September 2002. The 39 revised full papers presented together with an full invited paper were carefully reviewed and selected from 83 submissions. Among the topics addressed are exact and approximate algorithms for genomics, genetics, sequence analysis, gene and signal recognition, alignment, molecular evolution, phylogenetics, structure determination and prediction, gene expression and gene networks, proteomics, functional genomics, and drug design.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references and index.

This book constitutes the refereed proceedings of the Second International Bioinformatics, WABI 2002, held in Rome, Italy, in September 2002. The 39 revised full papers presented together with an full invited paper were carefully reviewed and selected from 83 submissions. Among the topics addressed are exact and approximate algorithms for genomics, genetics, sequence analysis, gene and signal recognition, alignment, molecular evolution, phylogenetics, structure determination and prediction, gene expression and gene networks, proteomics, functional genomics, and drug design.

Simultaneous Relevant Feature Identification and Classification in High-Dimensional Spaces -- Pooled Genomic Indexing (PGI): Mathematical Analysis and Experiment Design -- Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem -- Methods for Inferring Block-Wise Ancestral History from Haploid Sequences -- Finding Signal Peptides in Human Protein Sequences Using Recurrent Neural Networks -- Generating Peptide Candidates from Amino-Acid Sequence Databases for Protein Identification via Mass Spectrometry -- Improved Approximation Algorithms for NMR Spectral Peak Assignment -- Efficient Methods for Inferring Tandem Duplication History -- Genome Rearrangement Phylogeny Using Weighbor -- Segment Match Refinement and Applications -- Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation -- Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics -- FAUST: An Algorithm for Extracting Functionally Relevant Templates from Protein Structures -- Efficient Unbound Docking of Rigid Molecules -- A Method of Consolidating and Combining EST and mRNA Alignments to a Genome to Enumerate Supported Splice Variants -- A Method to Improve the Performance of Translation Start Site Detection and Its Application for Gene Finding -- Comparative Methods for Gene Structure Prediction in Homologous Sequences -- MultiProt -- A Multiple Protein Structural Alignment Algorithm -- A Hybrid Scoring Function for Protein Multiple Alignment -- Functional Consequences in Metabolic Pathways from Phylogenetic Profiles -- Finding Founder Sequences from a Set of Recombinants -- Estimating the Deviation from a Molecular Clock -- Exploring the Set of All Minimal Sequences of Reversals -- An Application to Test the Replication-Directed Reversal Hypothesis -- Approximating the Expected Number of Inversions Given the Number of Breakpoints -- Invited Lecture -- Accelerating Smith-Waterman Searches -- Sequence-Length Requirements for Phylogenetic Methods -- Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle -- NeighborNet: An Agglomerative Method for the Construction of Planar Phylogenetic Networks -- On the Control of Hybridization Noise in DNA Sequencing-by-Hybridization -- Restricting SBH Ambiguity via Restriction Enzymes -- Invited Lecture -- Molecule as Computation: Towards an Abstraction of Biomolecular Systems -- Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search -- Rapid Large-Scale Oligonucleotide Selection for Microarrays -- Border Length Minimization in DNA Array Design* -- The Enhanced Suffix Array and Its Applications to Genome Analysis -- The Algorithmic of Gene Teams -- Combinatorial Use of Short Probes for Differential Gene Expression Profiling -- Designing Specific Oligonucleotide Probes for the Entire S. cerevisiae Transcriptome -- K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data -- Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data -- Modified Mincut Supertrees.

English.

There are no comments for this item.

to post a comment.

Powered by Koha