04472nam 2200625Ia 450 991048402340332120200520144314.01-280-38845-597866135663793-642-15294-510.1007/978-3-642-15294-8(CKB)2670000000045046(SSID)ssj0000446296(PQKBManifestationID)11282003(PQKBTitleCode)TC0000446296(PQKBWorkID)10496193(PQKB)10685236(DE-He213)978-3-642-15294-8(MiAaPQ)EBC3065859(PPN)149024517(EXLCZ)99267000000004504620101101d2010 uy 0engurnn|008mamaatxtccrAlgorithms in bioinformatics 10th international workshop, WABI 2010, Liverpool, UK, September 6-8, 2010 : proceedings /Vincent Moulton, Mona Singh (eds.)1st ed. 2010.Berlin Springer20101 online resource (XII, 376 p. 94 illus.) Lecture notes in computer science ;6293Lecture notes in bioinformaticsInternational conference proceedings.3-642-15293-7 Includes bibliographical references and index.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.Lecture notes in computer science.Lecture notes in bioinformatics.Lecture notes in computer science ;6293.BioinformaticsCongressesComputer algorithmsCongressesBioinformaticsComputer algorithms570.285570GyFmDBMoulton Vincent1756996Singh Mona1756997WABI (Workshop)MiAaPQMiAaPQMiAaPQBOOK9910484023403321Algorithms in bioinformatics4194634UNINA