Atjaunināt sīkdatņu piekrišanu

E-grāmata: Algorithms in Bioinformatics: 13th International Workshop, WABI 2013, Sophia Antipolis, France, September 2-4, 2013. Proceedings

Edited by , Edited by
  • Formāts: PDF+DRM
  • Sērija : Lecture Notes in Bioinformatics 8126
  • Izdošanas datums: 16-Aug-2013
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Valoda: eng
  • ISBN-13: 9783642404535
  • Formāts - PDF+DRM
  • Cena: 53,52 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Ielikt grozā
  • Pievienot vēlmju sarakstam
  • Šī e-grāmata paredzēta tikai personīgai lietošanai. E-grāmatas nav iespējams atgriezt un nauda par iegādātajām e-grāmatām netiek atmaksāta.
  • Formāts: PDF+DRM
  • Sērija : Lecture Notes in Bioinformatics 8126
  • Izdošanas datums: 16-Aug-2013
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Valoda: eng
  • ISBN-13: 9783642404535

DRM restrictions

  • Kopēšana (kopēt/ievietot):

    nav atļauts

  • Drukāšana:

    nav atļauts

  • Lietošana:

    Digitālo tiesību pārvaldība (Digital Rights Management (DRM))
    Izdevējs ir piegādājis šo grāmatu šifrētā veidā, kas nozīmē, ka jums ir jāinstalē bezmaksas programmatūra, lai to atbloķētu un lasītu. Lai lasītu šo e-grāmatu, jums ir jāizveido Adobe ID. Vairāk informācijas šeit. E-grāmatu var lasīt un lejupielādēt līdz 6 ierīcēm (vienam lietotājam ar vienu un to pašu Adobe ID).

    Nepieciešamā programmatūra
    Lai lasītu šo e-grāmatu mobilajā ierīcē (tālrunī vai planšetdatorā), jums būs jāinstalē šī bezmaksas lietotne: PocketBook Reader (iOS / Android)

    Lai lejupielādētu un lasītu šo e-grāmatu datorā vai Mac datorā, jums ir nepieciešamid Adobe Digital Editions (šī ir bezmaksas lietotne, kas īpaši izstrādāta e-grāmatām. Tā nav tas pats, kas Adobe Reader, kas, iespējams, jau ir jūsu datorā.)

    Jūs nevarat lasīt šo e-grāmatu, izmantojot Amazon Kindle.

This book constitutes the refereed proceedings of the 13th International Workshop on Algorithms in Bioinformatics, WABI 2013, held in Sophia Antipolis, France, in September 2013. WABI 2013 is one of seven workshops which, along with the European Symposium on Algorithms (ESA), constitute the ALGO annual meeting and highlights research in algorithmic work for bioinformatics, computational biology and systems biology. The goal is to present recent research results, including significant work-in-progress, and to identify and explore directions of future research. The 27 full papers presented were carefully reviewed and selected from 61 submissions. The papers cover all aspects of algorithms in bioinformatics, computational biology and systems biology.

Extending the Reach of Phylogenetic Inference.- Protein (Multi-)Location Prediction: Using Location Inter-Dependencies in a Probabilistic Framework.- Towards Reliable Automatic Protein Structure Alignment.- A Minimum-Labeling Approach for Reconstructing Protein Networks across Multiple Conditions.- Faster mass decomposition.- On NP-Hardness of the Paired de Bruijn Sound Cycle Problem.- Accurate Decoding of Pooled Sequenced Data Using Compressed Sensing.- A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths.- A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs and its application to the detection of alternative splicing in RNA-seq data.- Graph-Distance within RNA Secondary Structure Ensembles.- Faster Algorithms for RNA-folding using the Four-Russians method.- Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree.- The generalized Robi

nson-Foulds metric.- Computing the Skewness of the Phylogenetic Mean Pairwise Distance in Linear Time.- Characterizing Compatibility and Agreement of Unrooted Trees via Cuts in Graphs.- Unifying Parsimonious Tree.- Sibelia: A scalable and comprehensive synteny block generation tool for closely related microbial genomes.- On the matrix median problem.- Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications.- MSARC: Multiple Sequence Alignment by Residue Clustering.- Mutual Enrichment in Ranked Lists and the Statistical Assessment of Position Weight Matrix Motifs.- Probabilistic Approaches to Alignment with Tandem Repeats.- Multiscale Identification of Topological Domains in Chromatin.- Modeling Intratumor Gene Copy Number Heterogeneity using Fluorescence in Situ Hybridization data.- Phylogenetic Analysis of Cell Types using Histone Modifications.- Detecting Superbubbles in Assembly Graphs.- A hybrid assembly using high throughput short and long.- Using

cascading Bloom filters to improve the memory usage for de Bruijn graphs. 
Extending the Reach of Phylogenetic Inference
1(2)
Bernard M.E. Moret
Protein (Multi-)Location Prediction: Using Location Inter-dependencies in a Probabilistic Framework
3(15)
Ramanuja Simha
Hagit Shatkay
Towards Reliable Automatic Protein Structure Alignment
18(15)
Xuefeng Cui
Shuai Cheng Li
Dongbo Bu
Ming Li
A Minimum-Labeling Approach for Reconstructing Protein Networks across Multiple Conditions
33(12)
Arnon Mazza
Irit Gat-Viks
Hesso Farhan
Roded Sharan
Faster Mass Decomposition
45(14)
Kai Duhrkop
Marcus Ludwig
Marvin Meusel
Sebastian Bocker
On NP-Hardness of the Paired de Bruijn Sound Cycle Problem
59(11)
Evgeny Kapun
Fedor Tsarev
Accurate Decoding of Pooled Sequenced Data Using Compressed Sensing
70(15)
Denisa Duma
Mary Wootters
Anna C. Gilbert
Hung Q. Ngo
Atri Rudra
Matthew Alpert
Timothy J. Close
Gianfranco Ciardo
Stefano Lonardi
A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths
85(14)
Alexandru I. Tomescu
Anna Kuosmanen
Romeo Rizzi
Veli Makinen
A Polynomial Delay Algorithm for the Enumeration of Bubbles with Length Constraints in Directed Graphs and Its Application to the Detection of Alternative Splicing in RNA-seq Data
99(13)
Gustavo Sacomoto
Vincent Lacroix
Marie-France Sagot
Distribution of Graph-Distances in Boltzmann Ensembles of RNA Secondary Structures
112(14)
Rolf Backofen
Markus Fricke
Manja Marz
Jing Qin
Peter F. Stadler
Faster Algorithms for RNA-Folding Using the Four-Russians Method
126(15)
Balaji Venkatachalam
Dan Gusfield
Yelena Frid
Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree
141(15)
Jesper Jansson
Chuanqi Shen
Wing-Kin Sung
The Generalized Robinson-Foulds Metric
156(14)
Sebastian Bocker
Stefan Canzar
Gunnar W. Klau
Computing the Skewness of the Phylogenetic Mean Pairwise Distance in Linear Time
170(15)
Constantinos Tsirogiannis
Brody Sandel
Characterizing Compatibility and Agreement of Unrooted Trees via Cuts in Graphs
185(15)
Sudheer Vakati
David Fernandez-Baca
Unifying Parsimonious Tree Reconciliation
200(15)
Nicolas Wieseke
Matthias Bernt
Martin Middendorf
Sibelia: A Scalable and Comprehensive Synteny Block Generation Tool for Closely Related Microbial Genomes
215(15)
Ilya Minkin
Anand Patel
Mikhail Kolmogorov
Nikolay Vyahhi
Son Pham
On the Matrix Median Problem
230(14)
Joao Paulo Pereira Zanetti
Priscila Biller
Joao Meidanis
A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications
244(15)
Laurent Bulteau
Guillaume Fertin
Christian Komusiewicz
Irena Rusu
MSARC: Multiple Sequence Alignment by Residue Clustering
259(14)
Michal Modzelewski
Norbert Dojer
Mutual Enrichment in Ranked Lists and the Statistical Assessment of Position Weight Matrix Motifs
273(14)
Limor Leibovich
Zohar Yakhini
Probabilistic Approaches to Alignment with Tandem Repeats
287(13)
Michal Nanasi
Tomas Vinar
Brona Brejova
Multiscale Identification of Topological Domains in Chromatin
300(13)
Darya Filippova
Rob Patro
Geet Duggal
Carl Kingsford
Modeling Intratumor Gene Copy Number Heterogeneity Using Fluorescence in Situ Hybridization Data
313(13)
Charalampos E. Tsourakakis
Phylogenetic Analysis of Cell Types Using Histone Modifications
326(12)
Nishanth Ulhas Nair
Yu Lin
Philipp Bucher
Bernard M.E. Moret
Detecting Superbubbles in Assembly Graphs
338(11)
Taku Onodera
Kunihiko Sadakane
Tetsuo Shibuya
Cerulean: A Hybrid Assembly Using High Throughput Short and Long Reads
349(15)
Viraj Deshpande
Eric D.K. Fung
Son Pham
Vineet Bafna
Using Cascading Bloom Filters to Improve the Memory Usage for de Brujin Graphs
364(13)
Kamil Salikhov
Gustavo Sacomoto
Gregory Kucherov
Author Index 377