These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
131 related articles for article (PubMed ID: 28174677)
1. MACFP: Maximal Approximate Consecutive Frequent Pattern Mining under Edit Distance. Shang J; Peng J; Han J Proc SIAM Int Conf Data Min; 2016 May; 2016():558-566. PubMed ID: 28174677 [TBL] [Abstract][Full Text] [Related]
2. An algorithm for approximate tandem repeats. Landau GM; Schmidt JP; Sokol D J Comput Biol; 2001; 8(1):1-18. PubMed ID: 11339903 [TBL] [Abstract][Full Text] [Related]
3. Error Tree: A Tree Structure for Hamming and Edit Distances and Wildcards Matching. Al-Okaily A J Comput Biol; 2015 Dec; 22(12):1118-28. PubMed ID: 26402070 [TBL] [Abstract][Full Text] [Related]
4. Efficient sequential and parallel algorithms for finding edit distance based motifs. Pal S; Xiao P; Rajasekaran S BMC Genomics; 2016 Aug; 17 Suppl 4(Suppl 4):465. PubMed ID: 27557423 [TBL] [Abstract][Full Text] [Related]
5. Approximate Graph Edit Distance in Quadratic Time. Riesen K; Ferrer M; Bunke H IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(2):483-494. PubMed ID: 26390496 [TBL] [Abstract][Full Text] [Related]
6. libFLASM: a software library for fixed-length approximate string matching. Ayad LA; Pissis SP; Retha A BMC Bioinformatics; 2016 Nov; 17(1):454. PubMed ID: 27832739 [TBL] [Abstract][Full Text] [Related]
7. An Efficient Incremental Mining Algorithm for Discovering Sequential Pattern in Wireless Sensor Network Environments. Lyu X; Ma H Sensors (Basel); 2018 Dec; 19(1):. PubMed ID: 30577676 [TBL] [Abstract][Full Text] [Related]
8. Fast online and index-based algorithms for approximate search of RNA sequence-structure patterns. Meyer F; Kurtz S; Beckstette M BMC Bioinformatics; 2013 Jul; 14():226. PubMed ID: 23865810 [TBL] [Abstract][Full Text] [Related]
9. Shifted Hamming distance: a fast and accurate SIMD-friendly filter to accelerate alignment verification in read mapping. Xin H; Greth J; Emmons J; Pekhimenko G; Kingsford C; Alkan C; Mutlu O Bioinformatics; 2015 May; 31(10):1553-60. PubMed ID: 25577434 [TBL] [Abstract][Full Text] [Related]
10. Parallel Methods for Finding k-Mismatch Shortest Unique Substrings Using GPU. Schultz DW; Xu B IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(1):386-395. PubMed ID: 31425048 [TBL] [Abstract][Full Text] [Related]
11. A Provably Efficient Algorithm for the k-Mismatch Average Common Substring Problem. Thankachan SV; Apostolico A; Aluru S J Comput Biol; 2016 Jun; 23(6):472-82. PubMed ID: 27058840 [TBL] [Abstract][Full Text] [Related]
13. NSAMD: A new approach to discover structured contiguous substrings in sequence datasets using Next-Symbol-Array. Pari A; Baraani A; Parseh S Comput Biol Chem; 2016 Oct; 64():384-395. PubMed ID: 27620380 [TBL] [Abstract][Full Text] [Related]
14. An efficient approach to mining maximal contiguous frequent patterns from large DNA sequence databases. Karim MR; Rashid MM; Jeong BS; Choi HJ Genomics Inform; 2012 Mar; 10(1):51-7. PubMed ID: 23105929 [TBL] [Abstract][Full Text] [Related]
15. NOSEP: Nonoverlapping Sequence Pattern Mining With Gap Constraints. Youxi Wu ; Yao Tong ; Xingquan Zhu ; Xindong Wu IEEE Trans Cybern; 2018 Oct; 48(10):2809-2822. PubMed ID: 28976327 [TBL] [Abstract][Full Text] [Related]
16. An edit-distance model for the approximate matching of timed strings. Dobrisek S; Zibert J; Pavesić N; Mihelic F IEEE Trans Pattern Anal Mach Intell; 2009 Apr; 31(4):736-41. PubMed ID: 19229087 [TBL] [Abstract][Full Text] [Related]