A Space Efficient Algorithm for Sequence Alignment with Inversions

DOI10.1007/3-540-45071-8_8zbMATH Open1276.92087OpenAlexW1783789643MaRDI QIDQ3082913FDOQ3082913

Robert Niewiadomski, Yang Wang, Zhi-Zhong Chen, Yong Gao, Junfeng Wu

Publication date: 18 March 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45071-8_8

Recommendations

• A space-efficient algorithm for sequence alignment with inversions and reversals
• A sparse dynamic programming algorithm for alignment with non-overlapping inversions
• Implementation and Application of Automata
• A local algorithm for DNA sequence alignment with inversions
• A space efficient algorithm for finding the best nonoverlapping alignment score
• Efficient matching of biological sequences allowing for non-overlapping inversions
• scientific article; zbMATH DE number 5171901
• An efficient algorithm for sequence comparison with block reversals
• General space-efficient sampling algorithm for suboptimal alignment

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39)

Cited In (9)

• A local algorithm for DNA sequence alignment with inversions
• Title not available (Why is that?)
• A space-efficient algorithm for sequence alignment with inversions and reversals
• An efficient algorithm for sequence comparison with block reversals
• A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences
• General space-efficient sampling algorithm for suboptimal alignment
• A sparse dynamic programming algorithm for alignment with non-overlapping inversions
• Alignment with non-overlapping inversions and translocations on two strings
• A space efficient algorithm for finding the best nonoverlapping alignment score

This page was built for publication: A Space Efficient Algorithm for Sequence Alignment with Inversions

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