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.
4. Discovering and detecting transposable elements in genome sequences. Bergman CM; Quesneville H Brief Bioinform; 2007 Nov; 8(6):382-92. PubMed ID: 17932080 [TBL] [Abstract][Full Text] [Related]
5. Computing highly specific and mismatch tolerant oligomers efficiently. Yamada T; Morishita S Proc IEEE Comput Soc Bioinform Conf; 2003; 2():316-25. PubMed ID: 16452807 [TBL] [Abstract][Full Text] [Related]
6. Fast and sensitive algorithm for aligning ESTs to human genome. Ogasawara J; Morishita S Proc IEEE Comput Soc Bioinform Conf; 2002; 1():43-53. PubMed ID: 15838122 [TBL] [Abstract][Full Text] [Related]
7. Optimal pairwise alignment of fixed protein structures in subquadratic time. Poleksic A J Bioinform Comput Biol; 2011 Jun; 9(3):367-82. PubMed ID: 21714130 [TBL] [Abstract][Full Text] [Related]
9. Sigma: multiple alignment of weakly-conserved non-coding DNA sequence. Siddharthan R BMC Bioinformatics; 2006 Mar; 7():143. PubMed ID: 16542424 [TBL] [Abstract][Full Text] [Related]
10. Heuristic reusable dynamic programming: efficient updates of local sequence alignment. Hong C; Tewfik AH IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(4):570-82. PubMed ID: 19875856 [TBL] [Abstract][Full Text] [Related]
11. Aligning multiple protein sequences by parallel hybrid genetic algorithm. Nguyen HD; Yoshihara I; Yamamori K; Yasunaga M Genome Inform; 2002; 13():123-32. PubMed ID: 14571381 [TBL] [Abstract][Full Text] [Related]
12. Efficient mapping of genomic sequences to optimize multiple pairwise alignment in hybrid cluster platforms. Montañola A; Roig C; Hernández P J Integr Bioinform; 2014 Oct; 11(3):251. PubMed ID: 25339085 [TBL] [Abstract][Full Text] [Related]
13. Improving the practical space and time efficiency of the shortest-paths approach to sum-of-pairs multiple sequence alignment. Gupta SK; Kececioglu JD; Schäffer AA J Comput Biol; 1995; 2(3):459-72. PubMed ID: 8521275 [TBL] [Abstract][Full Text] [Related]
14. New bounds and tractable instances for the transposition distance. Labarre A IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(4):380-94. PubMed ID: 17085847 [TBL] [Abstract][Full Text] [Related]
15. Voting algorithms for the motif finding problem. Liu X; Ma B; Wang L Comput Syst Bioinformatics Conf; 2008; 7():37-47. PubMed ID: 19642267 [TBL] [Abstract][Full Text] [Related]
17. Pairwise alignment for very long nucleic acid sequences. Sun J; Chen K; Hao Z Biochem Biophys Res Commun; 2018 Jul; 502(3):313-317. PubMed ID: 29800571 [TBL] [Abstract][Full Text] [Related]
18. A knowledge-based multiple-sequence alignment algorithm. Nguyen KD; Pan Y IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(4):884-96. PubMed ID: 24334383 [TBL] [Abstract][Full Text] [Related]
19. Space-conserving optimal DNA-protein alignment. Ko P; Narayanan M; Kalyanaraman A; Aluru S Proc IEEE Comput Syst Bioinform Conf; 2004; ():80-8. PubMed ID: 16448002 [TBL] [Abstract][Full Text] [Related]
20. Kalign--an accurate and fast multiple sequence alignment algorithm. Lassmann T; Sonnhammer EL BMC Bioinformatics; 2005 Dec; 6():298. PubMed ID: 16343337 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]