On graph-based data structures to multiple genome alignment

MaRDI QIDQ5159214zbMATH OpenFDO

Authors Nafiseh Jafarzadeh, A. Iranmanesh

Publication date 26 October 2021

Full work available at URL https://match.pmf.kg.ac.rs/electronic_versions/Match83/n1/match83n1_33-62.pdf

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to biology (92-02) Genetics and epigenetics (92D10) Protein sequences, DNA sequences (92D20)

Recommendations

• Comparative Genomics
• Outerplanar graph data structure: a new computational analysis model of genome rearrangements
• Multiple alignment of biological sequences with gap flexibility
• On the complexity of sequence to graph alignment
• A multiple alignment approach for DNA sequences based on maximum weighted path algorithms

Cited in

(10)

• Fast and optimal sequence-to-graph alignment guided by seeds
• On the complexity of sequence to graph alignment
• Volume visualization of multiple alignment of large genomic DNA
• Multiple Alignment, Communication Cost, and Graph Matching
• Genome classification using overlap graph centralities
• Outerplanar graph data structure: a new computational analysis model of genome rearrangements
• scientific article; zbMATH DE number 6262292 (Why is no real title available?)
• Graph multiset transformation: a new framework for massively parallel computation inspired by DNA computing
• Local multiple alignment via subgraph enumeration
• Graph theory analysis of genomics problems: Community analysis of fragile sites correlations and of pseudogenes alignments

This page was built for publication: On graph-based data structures to multiple genome alignment

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