An efficient algorithm to detect palindromes in DNA sequences using periodicity transform

DOI10.1016/J.SIGPRO.2005.10.008MaRDI QIDQ1031240zbMATH OpenOpenAlexFDO

Authors Ravi Gupta, Ankush Mittal, Sumit Gupta

Publication date 29 October 2009

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.sigpro.2005.10.008

zbMATH Keywords

palindromesperiodic subspacesperiodicity transform

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Parallel detection of all palindromes in a string
• Palindromic decompositions with gaps and errors
• Finding approximate palindromes in strings
• A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching
• Palindromic decompositions with gaps and errors

This page was built for publication: An efficient algorithm to detect palindromes in DNA sequences using periodicity transform

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