Algorithms in Bioinformatics
Springer Berlin (Verlag)
978-3-642-33121-3 (ISBN)
Preserving Inversion Phylogeny Reconstruction.-Fast phylogenetic tree reconstruction using locality-sensitive hashing.-Efficient Computation of Popular Phylogenetic Tree Measures.-SibJoin: A Fast Heuristic for Half-Sibling Reconstruction.-Reconstructing the Evolution of Molecular Interaction Networks under the DMC and Link Dynamics Models.-Estimating population size via line graph reconstruction.-Extracting Conflict-free Information from Multi-labeled Trees.-Reducing Problems in Unrooted Tree Compatibility to Restricted Triangulations of Intersection Graphs.-An optimal reconciliation algorithm for gene trees with polytomies.-Accounting for gene tree uncertainties improves gene trees and reconciliation inference.-RNA Tree Comparisons Via Unrooted Unordered Alignments.-Tree decomposition and parameterized algorithms for RNA structure-sequence alignment including tertiary interactions and pseudoknots (extended abstract).-CLIIQ: Accurate Comparative Detection and Quantification of Expressed Isoforms in a Population.-Improved Lower Bounds on the Compatibility of Quartets, Triplets, and Multi-State Characters.
Erscheint lt. Verlag | 3.8.2012 |
---|---|
Reihe/Serie | Lecture Notes in Bioinformatics | Lecture Notes in Computer Science |
Zusatzinfo | XIII, 454 p. 105 illus. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 702 g |
Themenwelt | Informatik ► Weitere Themen ► Bioinformatik |
Naturwissenschaften ► Biologie | |
Schlagworte | Algorithm analysis and problem complexity • algorithms • de Bruijn graphs • graph reconstruction • Phylogenetic trees • Protein networks |
ISBN-10 | 3-642-33121-1 / 3642331211 |
ISBN-13 | 978-3-642-33121-3 / 9783642331213 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich