Maximum Parsimony Xor Haplotyping by Sparse Dictionary Selection

BMC Genomics - United Kingdom
doi 10.1186/1471-2164-14-645
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Tractable Cases of $(*,2)$ -Bounded Parsimony Haplotyping

IEEE/ACM Transactions on Computational Biology and Bioinformatics
BiotechnologyApplied MathematicsGenetics
2015English

Approximate Maximum Parsimony and Ancestral Maximum Likelihood

IEEE/ACM Transactions on Computational Biology and Bioinformatics
BiotechnologyApplied MathematicsGenetics
2010English

Figure 4: Topology Recovered With Maximum Parsimony.

English

Parametric Dictionary Design for Sparse Coding

IEEE Transactions on Signal Processing
Electronic EngineeringSignal ProcessingElectrical
2009English

Fisher Discrimination Dictionary Learning for Sparse Representation

2011English

Tensor Dictionary Learning With Sparse TUCKER Decomposition

2013English

Strategies for Phylogenetic Reconstruction - For the Maximum Parsimony Problem

2016English

Dictionary-Based Image Denoising by Fused-Lasso Atom Selection

Mathematical Problems in Engineering
MathematicsEngineering
2014English

Electron Hologram Denoising via Sparse Coding and Dictionary Learning

Microscopy and Microanalysis
Instrumentation
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy