LEADER 04472nam 2200625Ia 450 001 9910484023403321 005 20200520144314.0 010 $a1-280-38845-5 010 $a9786613566379 010 $a3-642-15294-5 024 7 $a10.1007/978-3-642-15294-8 035 $a(CKB)2670000000045046 035 $a(SSID)ssj0000446296 035 $a(PQKBManifestationID)11282003 035 $a(PQKBTitleCode)TC0000446296 035 $a(PQKBWorkID)10496193 035 $a(PQKB)10685236 035 $a(DE-He213)978-3-642-15294-8 035 $a(MiAaPQ)EBC3065859 035 $a(PPN)149024517 035 $a(EXLCZ)992670000000045046 100 $a20101101d2010 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms in bioinformatics $e10th international workshop, WABI 2010, Liverpool, UK, September 6-8, 2010 : proceedings /$fVincent Moulton, Mona Singh (eds.) 205 $a1st ed. 2010. 210 $aBerlin $cSpringer$d2010 215 $a1 online resource (XII, 376 p. 94 illus.) 225 1 $aLecture notes in computer science ;$v6293 225 1 $aLecture notes in bioinformatics 300 $aInternational conference proceedings. 311 $a3-642-15293-7 320 $aIncludes bibliographical references and index. 327 $aBiomolecular 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. 410 0$aLecture notes in computer science.$pLecture notes in bioinformatics. 410 0$aLecture notes in computer science ;$v6293. 606 $aBioinformatics$vCongresses 606 $aComputer algorithms$vCongresses 615 0$aBioinformatics 615 0$aComputer algorithms 676 $a570.285 686 $a570$2GyFmDB 701 $aMoulton$b Vincent$01756996 701 $aSingh$b Mona$01756997 712 12$aWABI (Workshop) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484023403321 996 $aAlgorithms in bioinformatics$94194634 997 $aUNINA