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.
3. Patternhunter II: highly sensitive and fast homology search. Li M; Ma B; Kisman D; Tromp J J Bioinform Comput Biol; 2004 Sep; 2(3):417-39. PubMed ID: 15359419 [TBL] [Abstract][Full Text] [Related]
4. Run probabilities of seed-like patterns and identifying good transition seeds. Yang J; Zhang L J Comput Biol; 2008 Dec; 15(10):1295-313. PubMed ID: 19040365 [TBL] [Abstract][Full Text] [Related]
5. All hits all the time: parameter-free calculation of spaced seed sensitivity. Mak DY; Benson G Bioinformatics; 2009 Feb; 25(3):302-8. PubMed ID: 19095701 [TBL] [Abstract][Full Text] [Related]
6. Hit integration for identifying optimal spaced seeds. Chung WH; Park SB BMC Bioinformatics; 2010 Jan; 11 Suppl 1(Suppl 1):S37. PubMed ID: 20122210 [TBL] [Abstract][Full Text] [Related]
7. A unifying framework for seed sensitivity and its application to subset seeds. Kucherov G; Noé L; Roytberg M J Bioinform Comput Biol; 2006 Apr; 4(2):553-69. PubMed ID: 16819802 [TBL] [Abstract][Full Text] [Related]
10. A Simplified Description of Child Tables for Sequence Similarity Search. Frith MC; Shrestha AMS IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(6):2067-2073. PubMed ID: 29994365 [TBL] [Abstract][Full Text] [Related]
11. PerFSeeB: designing long high-weight single spaced seeds for full sensitivity alignment with a given number of mismatches. Titarenko V; Titarenko S BMC Bioinformatics; 2023 Oct; 24(1):396. PubMed ID: 37875804 [TBL] [Abstract][Full Text] [Related]
12. tPatternHunter: gapped, fast and sensitive translated homology search. Kisman D; Li M; Ma B; Wang L Bioinformatics; 2005 Feb; 21(4):542-4. PubMed ID: 15374861 [TBL] [Abstract][Full Text] [Related]
13. An analysis of sequence alignment: heuristic algorithms. Bucak IÖ; Uslan V Annu Int Conf IEEE Eng Med Biol Soc; 2010; 2010():1824-7. PubMed ID: 21096142 [TBL] [Abstract][Full Text] [Related]
15. Multiple sequence alignment with arbitrary gap costs: computing an optimal solution using polyhedral combinatorics. Althaus E; Caprara A; Lenhof HP; Reinert K Bioinformatics; 2002; 18 Suppl 2():S4-S16. PubMed ID: 12385977 [TBL] [Abstract][Full Text] [Related]
16. Good spaced seeds for homology search. Choi KP; Zeng F; Zhang L Bioinformatics; 2004 May; 20(7):1053-9. PubMed ID: 14764573 [TBL] [Abstract][Full Text] [Related]
17. A tutorial of recent developments in the seeding of local alignment. Brown DG; Li M; Ma B J Bioinform Comput Biol; 2004 Dec; 2(4):819-42. PubMed ID: 15617167 [TBL] [Abstract][Full Text] [Related]
18. Using MUMmer to identify similar regions in large sequence sets. Delcher AL; Salzberg SL; Phillippy AM Curr Protoc Bioinformatics; 2003 Feb; Chapter 10():Unit 10.3. PubMed ID: 18428693 [TBL] [Abstract][Full Text] [Related]
19. PatternHunter II: highly sensitive and fast homology search. Li M; Ma B; Kisman D; Tromp J Genome Inform; 2003; 14():164-75. PubMed ID: 15706531 [TBL] [Abstract][Full Text] [Related]