Algorithms for Computational Biology : First International Conference, AlCoB 2014, Tarragona, Spain, July 1-3, 2014, Proceedings (Lecture Notes in Computer Science) (2014)

個数:

Algorithms for Computational Biology : First International Conference, AlCoB 2014, Tarragona, Spain, July 1-3, 2014, Proceedings (Lecture Notes in Computer Science) (2014)

  • 提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
    重要ご説明事項
    1. 納期遅延や、ご入手不能となる場合が若干ございます。
    2. 複数冊ご注文の場合は、ご注文数量が揃ってからまとめて発送いたします。
    3. 美品のご指定は承りかねます。

    ●3Dセキュア導入とクレジットカードによるお支払いについて
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Paperback:紙装版/ペーパーバック版/ページ数 275 p.
  • 言語 ENG
  • 商品コード 9783319079523
  • DDC分類 570.285

Full Description

This book constitutes the refereed proceedings of the First International Conference, AlCoB 2014, held in July 2014 in Tarragona, Spain.

The 20 revised full papers were carefully reviewed and selected from 39 submissions. The scope of AlCoB includes topics of either theoretical or applied interest, namely: exact sequence analysis, approximate sequence analysis, pairwise sequence alignment, multiple sequence alignment, sequence assembly, genome rearrangement, regulatory motif finding, phylogeny reconstruction, phylogeny comparison, structure prediction, proteomics: molecular pathways, interaction networks, transcriptomics: splicing variants, isoform inference and quantification, differential analysis, next-generation sequencing: population genomics, metagenomics, metatranscriptomics, microbiome analysis, systems biology.

Contents

Comparative Genomics Approaches to Identifying Functionally Related Genes.- A Greedy Algorithm for Hierarchical Complete Linkage Clustering.- Vester's Sensitivity Model for Genetic Networks with Time-Discrete Dynamics.- Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem.- Heuristics for the Sorting by Length-Weighted Inversions Problem on Signed Permutations.- On Low Treewidth Graphs and Supertrees.- On Optimal Read Trimming in Next Generation Sequencing and Its Complexity.- On the Implementation of Quantitative Model Refinement.- HapMonster: A Statistically Unified Approach for Variant Calling and Haplotyping Based on Phase-Informative Reads.- Mapping-Free and Assembly-Free Discovery of Inversion Breakpoints from Raw NGS Reads.- Modeling the Geometry of the Endoplasmic Reticulum Network.- On Sorting of Signed Permutations by Prefix and Suffix Reversals and Transpositions.- On the Diameter of Rearrangement Problems.- Efficiently Enumerating All Connected InducedSubgraphs of a Large Molecular Network.- On Algorithmic Complexity of Biomolecular Sequence Assembly Problem.- A Closed-Form Solution for Transcription Factor Activity Estimation Using Network Component Analysis.- SVEM: A Structural Variant Estimation Method Using Multi-mapped Reads on Breakpoints.- Analysis and Classification of Constrained DNA Elements with N-gram Graphs and Genomic Signatures.- Inference of Boolean Networks from Gene Interaction Graphs Using a SAT Solver.- RRCA: Ultra-Fast Multiple In-species Genome Alignments.- Exact Protein Structure Classification Using the Maximum Contact Map Overlap Metric. 

最近チェックした商品