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.
42. Exact algorithms for computing pairwise alignments and 3-medians from structure-annotated sequences (extended abstract). Evans PA; Wareham HT Pac Symp Biocomput; 2001; ():559-70. PubMed ID: 11262973 [TBL] [Abstract][Full Text] [Related]
43. Finding Maximal Exact Matches Using the r-Index. Rossi M; Oliva M; Bonizzoni P; Langmead B; Gagie T; Boucher C J Comput Biol; 2022 Feb; 29(2):188-194. PubMed ID: 35041518 [TBL] [Abstract][Full Text] [Related]
44. Clustering exact matches of pairwise sequence alignments by weighted linear regression. González AJ; Liao L BMC Bioinformatics; 2008 Feb; 9():102. PubMed ID: 18282291 [TBL] [Abstract][Full Text] [Related]
45. Fast optimal genome tiling with applications to microarray design and homology search. Berman P; Bertone P; Dasgupta B; Gerstein M; Kao MY; Snyder M J Comput Biol; 2004; 11(4):766-85. PubMed ID: 15579244 [TBL] [Abstract][Full Text] [Related]
46. An efficient algorithm for finding short approximate non-tandem repeats. Adebiyi EF; Jiang T; Kaufmann M Bioinformatics; 2001; 17 Suppl 1():S5-S12. PubMed ID: 11472987 [TBL] [Abstract][Full Text] [Related]
47. Poisson, compound Poisson and process approximations for testing statistical significance in sequence comparisons. Goldstein L; Waterman MS Bull Math Biol; 1992 Sep; 54(5):785-812. PubMed ID: 1638260 [TBL] [Abstract][Full Text] [Related]
48. Installing, Maintaining, and Using a Local Copy of BLAST for Compute Cluster or Workstation Use. Ladunga I Curr Protoc Bioinformatics; 2018 Sep; 63(1):e54. PubMed ID: 30168910 [TBL] [Abstract][Full Text] [Related]
49. Comparison of genomic DNA sequences: solved and unsolved problems. Miller W Bioinformatics; 2001 May; 17(5):391-7. PubMed ID: 11331233 [TBL] [Abstract][Full Text] [Related]
51. A framework for high-throughput sequence alignment using real processing-in-memory systems. Diab S; Nassereldine A; Alser M; Gómez Luna J; Mutlu O; El Hajj I Bioinformatics; 2023 May; 39(5):. PubMed ID: 36971586 [TBL] [Abstract][Full Text] [Related]
53. Global, highly specific and fast filtering of alignment seeds. Ebel M; Migliorelli G; Stanke M BMC Bioinformatics; 2022 Jun; 23(1):225. PubMed ID: 35689182 [TBL] [Abstract][Full Text] [Related]
55. Improved Search of Large Transcriptomic Sequencing Databases Using Split Sequence Bloom Trees. Solomon B; Kingsford C J Comput Biol; 2018 Jul; 25(7):755-765. PubMed ID: 29641248 [TBL] [Abstract][Full Text] [Related]
56. Linking temporal medical records using non-protected health information data. Bonomi L; Jiang X Stat Methods Med Res; 2018 Nov; 27(11):3304-3324. PubMed ID: 29298592 [TBL] [Abstract][Full Text] [Related]
57. GateKeeper: a new hardware architecture for accelerating pre-alignment in DNA short read mapping. Alser M; Hassan H; Xin H; Ergin O; Mutlu O; Alkan C Bioinformatics; 2017 Nov; 33(21):3355-3363. PubMed ID: 28575161 [TBL] [Abstract][Full Text] [Related]
58. Short Read Mapping: An Algorithmic Tour. Canzar S; Salzberg SL Proc IEEE Inst Electr Electron Eng; 2017 Mar; 105(3):436-458. PubMed ID: 28502990 [TBL] [Abstract][Full Text] [Related]