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.
108 related articles for article (PubMed ID: 26547984)
1. Application of consensus string matching in the diagnosis of allelic heterogeneity involving transposition mutation. Zohora FT; Rahman MS Int J Data Min Bioinform; 2015; 13(4):360-77. PubMed ID: 26547984 [TBL] [Abstract][Full Text] [Related]
2. 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]
3. A 1.375-approximation algorithm for sorting by transpositions. Elias I; Hartman T IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(4):369-79. PubMed ID: 17085846 [TBL] [Abstract][Full Text] [Related]
4. Compressed pattern matching in DNA sequences. Chen L; Lu S; Ram J Proc IEEE Comput Syst Bioinform Conf; 2004; ():62-8. PubMed ID: 16448000 [TBL] [Abstract][Full Text] [Related]
5. A fast Boyer-Moore type pattern matching algorithm for highly similar sequences. Ben Nsira N; Lecroq T; Elloumi M Int J Data Min Bioinform; 2015; 13(3):266-88. PubMed ID: 26547980 [TBL] [Abstract][Full Text] [Related]
6. Approximate matching of structured motifs in DNA sequences. El-Mabrouk N; Raffinot M; Duchesne JE; Lajoie M; Luc N J Bioinform Comput Biol; 2005 Apr; 3(2):317-42. PubMed ID: 15852508 [TBL] [Abstract][Full Text] [Related]
7. ABS: Sequence alignment by scanning. Bonny T; Salama KN Annu Int Conf IEEE Eng Med Biol Soc; 2011; 2011():928-31. PubMed ID: 22254463 [TBL] [Abstract][Full Text] [Related]
11. A Simple Linear Space Algorithm for Computing Nonoverlapping Inversion and Transposition Distance in Quadratic Average Time. Wang X; Wang L J Comput Biol; 2018 Jun; 25(6):563-575. PubMed ID: 29658774 [TBL] [Abstract][Full Text] [Related]
12. SEAN: SNP prediction and display program utilizing EST sequence clusters. Huntley D; Baldo A; Johri S; Sergot M Bioinformatics; 2006 Feb; 22(4):495-6. PubMed ID: 16357032 [TBL] [Abstract][Full Text] [Related]
14. Indelign: a probabilistic framework for annotation of insertions and deletions in a multiple alignment. Kim J; Sinha S Bioinformatics; 2007 Feb; 23(3):289-97. PubMed ID: 17110370 [TBL] [Abstract][Full Text] [Related]
15. Faster algorithms for optimal multiple sequence alignment based on pairwise comparisons. Bilu Y; Agarwal PK; Kolodny R IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(4):408-22. PubMed ID: 17085849 [TBL] [Abstract][Full Text] [Related]
16. Segmentation algorithm for DNA sequences. Zhang CT; Gao F; Zhang R Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Oct; 72(4 Pt 1):041917. PubMed ID: 16383430 [TBL] [Abstract][Full Text] [Related]
17. A pattern matching approach for the estimation of alignment between any two given DNA sequences. Basu K; Sriraam N; Richard RJ J Med Syst; 2007 Aug; 31(4):247-53. PubMed ID: 17685148 [TBL] [Abstract][Full Text] [Related]
18. An algorithm for finding signals of unknown length in DNA sequences. Pavesi G; Mauri G; Pesole G Bioinformatics; 2001; 17 Suppl 1():S207-14. PubMed ID: 11473011 [TBL] [Abstract][Full Text] [Related]
19. Fast exact algorithms for the closest string and substring problems with application to the planted (L, d)-motif model. Chen ZZ; Wang L IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1400-10. PubMed ID: 21282867 [TBL] [Abstract][Full Text] [Related]
20. An O(N2) algorithm for discovering optimal Boolean pattern pairs. Bannai H; Hyyrö H; Shinohara A; Takeda M; Nakai K; Miyano S IEEE/ACM Trans Comput Biol Bioinform; 2004; 1(4):159-70. PubMed ID: 17051698 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]