An efficient method for finding repeats in molecular sequences.
AUTOR(ES)
Martinez, H M
RESUMO
The problem of finding repeats in molecular sequences is approached as a sorting problem. It leads to a method which is linear in space complexity and NlogN in expected time complexity. The implementation is straightforward and can therefore be used to handle large sequences with relative ease. Of particular interest is that several sequences can be treated as a single sequence. This leads to an efficient method for finding dyads and for finding common features of many sequences, such as favorable alignments.
ACESSO AO ARTIGO
http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=326069Documentos Relacionados
- Pattern recognition in nucleic acid sequences. II. An efficient method for finding locally stable secondary structures.
- An efficient method for matching nucleic acid sequences.
- Finding errors in DNA sequences.
- Pattern recognition in nucleic acid sequences. I. A general method for finding local homologies and symmetries.
- A computer method for finding common base paired helices in aligned sequences: application to the analysis of random sequences.
