FEEDBACK Smiley face
Normal view MARC view ISBD view

Algorithms in Bioinformatics [electronic resource] :First International Workshop, WABI 2001 Århus Denmark, August 28–31, 2001 Proceedings /

Contributor(s): Gascuel, Olivier [editor.] | Moret, Bernard M. E [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 2149Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2001.Description: X, 314 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540446965.Subject(s): Computer science | Computer programming | Data structures (Computer science) | Computers | Algorithms | Life sciences | Computer Science | Programming Techniques | Life Sciences, general | Data Structures, Cryptology and Information Theory | Algorithm Analysis and Problem Complexity | Data Structures | Computation by Abstract DevicesOnline resources: Click here to access online
Contents:
An Improved Model for Statistical Alignment -- Improving Profile-Profile Alignments via Log Average Scoring -- False Positives in Genomic Map Assembly and Sequence Validation -- Boosting EM for Radiation Hybrid and Genetic Mapping -- Placing Probes along the Genome Using Pairwise Distance Data -- Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar -- Assessing the Statistical Significance of Overrepresented Oligonucleotides -- Pattern Matching and Pattern Discovery Algorithms for Protein Topologies -- Computing Linking Numbers of a Filtration -- Side Chain-Positioning as an Integer Programming Problem -- A Chemical-Distance-Based Test for Positive Darwinian Selection -- Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time -- Experiments in Computing Sequences of Reversals -- Exact-IEBP: A New Technique for Estimating Evolutionary Distances between Whole Genomes -- Finding an Optimal Inversion Median: Experimental Results -- Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites -- The Performance of Phylogenetic Methods on Trees of Bounded Diameter -- (1+?)-Approximation of Sorting by Reversals and Transpositions -- On the Practical Solution of the Reversal Median Problem -- Algorithms for Finding Gene Clusters -- Determination of Binding Amino Acids Based on Random Peptide Array Screening Data -- A Simple Hyper-Geometric Approach for Discovering Putative Transcription Factor Binding Sites -- Comparing Assemblies Using Fragments and Mate-Pairs.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

An Improved Model for Statistical Alignment -- Improving Profile-Profile Alignments via Log Average Scoring -- False Positives in Genomic Map Assembly and Sequence Validation -- Boosting EM for Radiation Hybrid and Genetic Mapping -- Placing Probes along the Genome Using Pairwise Distance Data -- Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar -- Assessing the Statistical Significance of Overrepresented Oligonucleotides -- Pattern Matching and Pattern Discovery Algorithms for Protein Topologies -- Computing Linking Numbers of a Filtration -- Side Chain-Positioning as an Integer Programming Problem -- A Chemical-Distance-Based Test for Positive Darwinian Selection -- Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time -- Experiments in Computing Sequences of Reversals -- Exact-IEBP: A New Technique for Estimating Evolutionary Distances between Whole Genomes -- Finding an Optimal Inversion Median: Experimental Results -- Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites -- The Performance of Phylogenetic Methods on Trees of Bounded Diameter -- (1+?)-Approximation of Sorting by Reversals and Transpositions -- On the Practical Solution of the Reversal Median Problem -- Algorithms for Finding Gene Clusters -- Determination of Binding Amino Acids Based on Random Peptide Array Screening Data -- A Simple Hyper-Geometric Approach for Discovering Putative Transcription Factor Binding Sites -- Comparing Assemblies Using Fragments and Mate-Pairs.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in