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.
113 related articles for article (PubMed ID: 25961045)
1. A Practical and Scalable Tool to Find Overlaps between Sequences. Rachid MH; Malluhi Q Biomed Res Int; 2015; 2015():905261. PubMed ID: 25961045 [TBL] [Abstract][Full Text] [Related]
2. Two Efficient Techniques to Find Approximate Overlaps between Sequences. Haj Rachid M Biomed Res Int; 2017; 2017():2731385. PubMed ID: 28293632 [TBL] [Abstract][Full Text] [Related]
3. Using the Sadakane compressed suffix tree to solve the all-pairs suffix-prefix problem. Rachid MH; Malluhi Q; Abouelhoda M Biomed Res Int; 2014; 2014():745298. PubMed ID: 24834435 [TBL] [Abstract][Full Text] [Related]
4. Next-generation sequencing technologies and fragment assembly algorithms. Lee H; Tang H Methods Mol Biol; 2012; 855():155-74. PubMed ID: 22407708 [TBL] [Abstract][Full Text] [Related]
5. Pipeliner: software to evaluate the performance of bioinformatics pipelines for next-generation resequencing. Nevado B; Perez-Enciso M Mol Ecol Resour; 2015 Jan; 15(1):99-106. PubMed ID: 24890372 [TBL] [Abstract][Full Text] [Related]
7. CLAGen: a tool for clustering and annotating gene sequences using a suffix tree algorithm. Han Si; Lee SG; Kim KH; Choi CJ; Kim YH; Hwang KS Biosystems; 2006 Jun; 84(3):175-82. PubMed ID: 16384634 [TBL] [Abstract][Full Text] [Related]
9. OligoTag: a program for designing sets of tags for next-generation sequencing of multiplexed samples. Coissac E Methods Mol Biol; 2012; 888():13-31. PubMed ID: 22665273 [TBL] [Abstract][Full Text] [Related]
10. Repeats identification using improved suffix trees. Huo H; Wang X; Stojkovic V Int J Comput Biol Drug Des; 2009; 2(3):264-77. PubMed ID: 20090164 [TBL] [Abstract][Full Text] [Related]
11. Querying highly similar sequences. Barton C; Giraud M; Iliopoulos CS; Lecroq T; Mouchard L; Pissis SP Int J Comput Biol Drug Des; 2013; 6(1-2):119-30. PubMed ID: 23428478 [TBL] [Abstract][Full Text] [Related]
12. Sequencing and genome assembly using next-generation technologies. Nagarajan N; Pop M Methods Mol Biol; 2010; 673():1-17. PubMed ID: 20835789 [TBL] [Abstract][Full Text] [Related]
13. 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]
14. Apache Spark Implementations for String Patterns in DNA Sequences. Kanavos A; Livieris I; Mylonas P; Sioutas S; Vonitsanos G Adv Exp Med Biol; 2020; 1194():439-453. PubMed ID: 32468560 [TBL] [Abstract][Full Text] [Related]
16. Analysis of common k-mers for whole genome sequences using SSB-tree. Choi JH; Cho HG Genome Inform; 2002; 13():30-41. PubMed ID: 14571372 [TBL] [Abstract][Full Text] [Related]
17. An introduction to high-throughput sequencing experiments: design and bioinformatics analysis. Normand R; Yanai I Methods Mol Biol; 2013; 1038():1-26. PubMed ID: 23872966 [TBL] [Abstract][Full Text] [Related]
18. Sequence assembly using next generation sequencing data--challenges and solutions. Chin FY; Leung HC; Yiu SM Sci China Life Sci; 2014 Nov; 57(11):1140-8. PubMed ID: 25326069 [TBL] [Abstract][Full Text] [Related]
19. Compressive biological sequence analysis and archival in the era of high-throughput sequencing technologies. Giancarlo R; Rombo SE; Utro F Brief Bioinform; 2014 May; 15(3):390-406. PubMed ID: 24347576 [TBL] [Abstract][Full Text] [Related]
20. Exploring Scalable Parallelization for Edit Distance-Based Motif Search. Qiu J; Ebnenasir A IEEE/ACM Trans Comput Biol Bioinform; 2023; 20(2):1587-1593. PubMed ID: 37815943 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]