Algorithms in bioinformatics : 10th international workshop, WABI 2010, Liverpool, UK, September 6-8, 2010 : proceedings / Vincent Moulton, Mona Singh (eds.).
Contributor(s): Moulton, Vincent | Singh, MonaMaterial type: TextSeries: SerienbezeichnungLecture notes in computer science: 6293.; Lecture notes in computer science: Publisher: Berlin : Springer, 2010Description: 1 online resource (xi, 376 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783642152948; 3642152945Subject(s): Bioinformatics -- Congresses | Computer algorithms -- Congresses | Computational Biology | Algorithms | Computer algorithms | Kongress | Bioinformatik | Algorithmus | Bioinformatics | Liverpool <2010> | Informatique | Bioinformatics | Computer algorithms | Bioinformatik | Algorithmus | Liverpool <2010>Genre/Form: Congress. | Electronic books. | Conference papers and proceedings. | Kongress. Additional physical formats: Print version:: Algorithms in bioinformatics.DDC classification: 570.285 LOC classification: QH324.2 | .W33 2010Other classification: 42.11 | Q811. 4-532 Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
Includes bibliographical references and index.
Annotation This book constitutes the refereed proceedings of the 10th International Workshop on Algorithms in Bioinformatics, WABI 2010, held in Liverpool, UK, in September 2010. The 30 revised full papers presented were carefully reviewed and selected from 83 submissions. The papers are organized in topical sections on biomolecular structure: RNA, protein and molecular comparison; comparative genomics; haplotype and genotype analysis; high-throughput data analysis: next generation sequencing and flow cytometry; networks; phylogenetics; and sequences, strings and motifs.
Print version record.
Biomolecular Structure: RNA, Protein and Molecular Comparison -- A Worst-Case and Practical Speedup for the RNA Co-folding Problem Using the Four-Russians Idea -- Sparse Estimation for Structural Variability -- Data Structures for Accelerating Tanimoto Queries on Real Valued Vectors -- Sparsification of RNA Structure Prediction Including Pseudoknots -- Prediction of RNA Secondary Structure Including Kissing Hairpin Motifs -- Reducing the Worst Case Running Times of a Family of RNA and CFG Problems, Using Valiant's Approach -- Comparative Genomics -- Reconstruction of Ancestral Genome Subject to Whole Genome Duplication, Speciation, Rearrangement and Loss -- Genomic Distance with DCJ and Indels -- Listing All Sorting Reversals in Quadratic Time -- Haplotype and Genotype Analysis -- Discovering Kinship through Small Subsets -- Fixed-Parameter Algorithm for Haplotype Inferences on General Pedigrees with Small Number of Sites -- Haplotypes versus Genotypes on Pedigrees -- Haplotype Inference on Pedigrees with Recombinations and Mutations -- High-throughput Data Analysis: Next Generation Sequencing and Flow Cytometry -- Identifying Rare Cell Populations in Comparative Flow Cytometry -- Fast Mapping and Precise Alignment of AB SOLiD Color Reads to Reference DNA -- Design of an Efficient Out-of-Core Read Alignment Algorithm -- Estimation of Alternative Splicing isoform Frequencies from RNA-Seq Data -- Networks -- Improved Orientations of Physical Networks -- Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms -- Efficient Subgraph Frequency Estimation with G-Tries -- Phylogenetics -- Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution -- The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree -- Reducing Multi-state to Binary Perfect Phylogeny with Applications to Missing, Removable, Inserted, and Deleted Data -- An Experimental Study of Quartets MaxCut and Other Supertree Methods -- An Efficient Method for DNA-Based Species Assignment via Gene Tree and Species Tree Reconciliation -- Sequences, Strings and Motifs -- Effective Algorithms for Fusion Gene Detection -- Swiftly Computing Center Strings -- Speeding Up Exact Motif Discovery by Bounding the Expected Clump Size -- Pair HMM Based Gap Statistics for Re-evaluation of Indels in Alignments with Affine Gap Penalties -- Quantifying the Strength of Natural Selection of a Motif Sequence.