Identifying occurrences of maximal pairs in multiple strings

DOI10.1007/3-540-45452-7_12MaRDI QIDQ4737695zbMATH OpenFDO

Authors Costas S. Iliopoulos, Christos Makris, Spyros Sioutas, Kostas Tsichlas, Athanasios K. Tsakalidis

Publication date 11 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2373/23730133.htm

zbMATH Keywords

DNA MatchingSearch TreesString Algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40)

Recommendations

• Efficient algorithms for molecular sequence analysis.
• scientific article; zbMATH DE number 2185638
• Motif matching using gapped patterns
• Local multiple alignment via subgraph enumeration
• Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences

Cited in

(3)

• Identifying periodic occurrences of a template with applications to protein structure
• Algorithms for extracting motifs from biological weighted sequences
• Longest repeats with a block of \(k\) don't cares

This page was built for publication: Identifying occurrences of maximal pairs in multiple strings

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