An effective haplotype assembly algorithm based on hypergraph partitioning
DOI10.1016/J.JTBI.2014.05.034zbMATH Open1412.92193OpenAlexW2035345774WikidataQ51075233 ScholiaQ51075233MaRDI QIDQ2415650FDOQ2415650
Authors: Xiao Chen, Qinke Peng, Libin Han, Tao Zhong, Tao Xu 
Publication date: 23 May 2019
Published in: Journal of Theoretical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jtbi.2014.05.034
Recommendations
- Self-organizing map approaches for the haplotype assembly problem
- The haplotype assembly model with genotype information and iterative local-exhaustive search algorithm
- Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information
- Enhanced evolutionary and heuristic algorithms for haplotype reconstruction problem using minimum error correction model
- Haplotype assembly from aligned weighted SNP fragments
computational biologysingle nucleotide polymorphismsingle individual haplotypingshared nearest neighbors
Cites Work
- iCDI-PseFpt: identify the channel-drug interaction in cellular networking with PseAAC and molecular fingerprints
- Some remarks on protein attribute prediction and pseudo amino acid composition
- Predicting plant protein subcellular multi-localization by Chou's PseAAC formulation based multi-label homolog knowledge transfer learning
- The disposition of the LZCC protein residues in wenxiang diagram provides new insights into the protein-protein interaction mechanism
- Title not available (Why is that?)
- Haplotype assembly from aligned weighted SNP fragments
- A clustering algorithm based on two distance functions for MEC model
Cited In (2)
Uses Software
This page was built for publication: An effective haplotype assembly algorithm based on hypergraph partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2415650)
