Non-overlapping common substrings allowing mutations

DOI10.1007/S11786-007-0030-6MaRDI QIDQ942988zbMATH OpenOpenAlexWikidataFDO

Authors Ho-Leung Chan, Tak-Wah Lam, Wing-Kin Sung, Prudence W. H. Wong, S. M. Yiu

Publication date 8 September 2008

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11786-007-0030-6

zbMATH Keywords

algorithmsmutationswhole genome alignmentconserved genes

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Problems related to evolution (92D15) Dynamic programming (90C39) Nonnumerical algorithms (68W05)

Recommendations

• Maximal common subsequences and minimal common supersequences
• On multiple longest common subsequence and common motifs with gaps (extended abstract)
• Finding similar regions in many strings
• scientific article; zbMATH DE number 776086
• Sparse LCS Common Substring Alignment

Cited in

(1)

• Positions of silent mutations in overlapping genes from different DNA strands

This page was built for publication: Non-overlapping common substrings allowing mutations

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