An efficient algorithm for attribute-based subsequence matching
- 12 December 2015
- journal article
- Published by Elsevier in Information Sciences
- Vol. 334-335, 323-337
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Number of distinct sequence alignments with k-match and match sectionsComputers in Biology and Medicine, 2015
- Motif matching using gapped patternsTheoretical Computer Science, 2014
- Safe MBR-transformation in similar sequence matchingInformation Sciences, 2014
- Algorithms for path-constrained sequence alignmentJournal of Discrete Algorithms, 2014
- The Move-Split-Merge Metric for Time SeriesIEEE Transactions on Knowledge and Data Engineering, 2012
- A brief survey on sequence classificationACM SIGKDD Explorations Newsletter, 2010
- Collaborative filtering with temporal dynamicsCommunications of the ACM, 2010
- MEME: discovering and analyzing DNA and protein sequence motifsNucleic Acids Research, 2006
- GeneRAGE: a robust algorithm for sequence clustering and domain detectionBioinformatics, 2000
- Basic local alignment search toolJournal of Molecular Biology, 1990