Multiple sequence comparison and consistency on multipartite graphs

DOI10.1006/AAMA.1995.1001MaRDI QIDQ1894790zbMATH OpenOpenAlexFDO

Authors Martin Vingron, Pavel Pevzner

Publication date 18 March 1996

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/aama.1995.1001

zbMATH Keywords

consistencytransitivityalgorithmcomplexityreconstructionalignmentspairwise comparisonsmultipartite graphsbiological sequence datamultiple sequence comparisonprotein elongation factor \(Tu\)

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Protein sequences, DNA sequences (92D20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Consistency of optimal sequence alignments
• OMG! Orthologs in multiple genomes -- competing graph-theoretical formulations
• Pattern recognition in several sequences: Consensus and alignment
• Local multiple alignment via subgraph enumeration
• The Multiple Sequence Alignment Problem in Biology

Cited in

(4)

• Walk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted
• Multiple Alignment, Communication Cost, and Graph Matching
• Local multiple alignment via subgraph enumeration
• A polyhedral approach to sequence alignment problems

This page was built for publication: Multiple sequence comparison and consistency on multipartite graphs

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