A mixed integer linear programming algorithm for plasmid binning

DOI10.1007/978-3-031-06220-9_16MaRDI QIDQ2163971zbMATH OpenOpenAlexFDO

Authors Aniket Mane, Mahsa Faizrahnemoon, Cedric Chauve

Publication date 11 August 2022

Full work available at URL https://doi.org/10.1007/978-3-031-06220-9_16

Mathematics Subject Classification ID

Mixed integer programming (90C11) Protein sequences, DNA sequences (92D20)

Recommendations

• Graphbin2: refined and overlapped binning of metagenomic contigs using assembly graphs
• MetaCoAG: binning metagenomic contigs via composition, coverage and assembly graphs
• Global optimization for scaffolding and completing genome assemblies
• Metagenomic reads binning with spaced seeds
• PathOGiST: A Novel Method for Clustering Pathogen Isolates by Combining Multiple Genotyping Signals

Cites work

• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

Cited in

(2)

• Aspects of Molecular Computing
• A multi-flow approach for binning circular plasmids from short-reads assembly graphs

Describes a project that uses

Uses Software

• SPAdes
• Unicycler
• HyAsP

This page was built for publication: A mixed integer linear programming algorithm for plasmid binning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163971)