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.
26. DIALIGN-T: an improved algorithm for segment-based multiple sequence alignment. Subramanian AR; Weyer-Menkhoff J; Kaufmann M; Morgenstern B BMC Bioinformatics; 2005 Mar; 6():66. PubMed ID: 15784139 [TBL] [Abstract][Full Text] [Related]
27. Improvement of the A(*) Algorithm for Multiple Sequence Alignment. Kobayashi H; Imai H Genome Inform Ser Workshop Genome Inform; 1998; 9():120-130. PubMed ID: 11072328 [TBL] [Abstract][Full Text] [Related]
28. Dynamite: a flexible code generating language for dynamic programming methods used in sequence comparison. Birney E; Durbin R Proc Int Conf Intell Syst Mol Biol; 1997; 5():56-64. PubMed ID: 9322016 [TBL] [Abstract][Full Text] [Related]
29. RBT-L: a location based approach for solving the Multiple Sequence Alignment problem. Taheri J; Zomaya AY Int J Bioinform Res Appl; 2010; 6(1):37-57. PubMed ID: 20110208 [TBL] [Abstract][Full Text] [Related]
30. Using multiple sequence alignment editors and formatters. Mount DW Cold Spring Harb Protoc; 2009 Jul; 2009(7):pdb.top45. PubMed ID: 20147226 [TBL] [Abstract][Full Text] [Related]
31. Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution. Song YS; Wu Y; Gusfield D Bioinformatics; 2005 Jun; 21 Suppl 1():i413-22. PubMed ID: 15961486 [TBL] [Abstract][Full Text] [Related]