104 related articles for article (PubMed ID: 16597241)
1. Efficient q-gram filters for finding all epsilon-matches over a given length.
Rasmussen KR; Stoye J; Myers EW
J Comput Biol; 2006 Mar; 13(2):296-308. PubMed ID: 16597241
[TBL] [Abstract][Full Text] [Related]
2. SST: an algorithm for finding near-exact sequence matches in time proportional to the logarithm of the database size.
Giladi E; Walker MG; Wang JZ; Volkmuth W
Bioinformatics; 2002 Jun; 18(6):873-7. PubMed ID: 12075023
[TBL] [Abstract][Full Text] [Related]
3. The efficient computation of position-specific match scores with the fast fourier transform.
Rajasekaran S; Jin X; Spouge JL
J Comput Biol; 2002; 9(1):23-33. PubMed ID: 11911793
[TBL] [Abstract][Full Text] [Related]
4. Space efficient computation of rare maximal exact matches between multiple sequences.
Ohlebusch E; Kurtz S
J Comput Biol; 2008 May; 15(4):357-77. PubMed ID: 18361760
[TBL] [Abstract][Full Text] [Related]
5. Efficient large-scale sequence comparison by locality-sensitive hashing.
Buhler J
Bioinformatics; 2001 May; 17(5):419-28. PubMed ID: 11331236
[TBL] [Abstract][Full Text] [Related]
6. A deterministic DNA database search.
Kheniche A; Salhi A; Harrison A; Dowden JM
Adv Exp Med Biol; 2010; 680():371-8. PubMed ID: 20865521
[TBL] [Abstract][Full Text] [Related]
7. Fast and sensitive multiple alignment of large genomic sequences.
Brudno M; Chapman M; Göttgens B; Batzoglou S; Morgenstern B
BMC Bioinformatics; 2003 Dec; 4():66. PubMed ID: 14693042
[TBL] [Abstract][Full Text] [Related]
8. STELLAR: fast and exact local alignments.
Kehr B; Weese D; Reinert K
BMC Bioinformatics; 2011 Oct; 12 Suppl 9(Suppl 9):S15. PubMed ID: 22151882
[TBL] [Abstract][Full Text] [Related]
9. Optimal spaced seeds for homologous coding regions.
Brejová B; Brown DG; Vinar T
J Bioinform Comput Biol; 2004 Jan; 1(4):595-610. PubMed ID: 15290755
[TBL] [Abstract][Full Text] [Related]
10. miBLAST: scalable evaluation of a batch of nucleotide sequence queries with BLAST.
Kim YJ; Boyd A; Athey BD; Patel JM
Nucleic Acids Res; 2005; 33(13):4335-44. PubMed ID: 16061938
[TBL] [Abstract][Full Text] [Related]
11. Compressed indexing and local alignment of DNA.
Lam TW; Sung WK; Tam SL; Wong CK; Yiu SM
Bioinformatics; 2008 Mar; 24(6):791-7. PubMed ID: 18227115
[TBL] [Abstract][Full Text] [Related]
12. An efficient Z-score algorithm for assessing sequence alignments.
Booth HS; Maindonald JH; Wilson SR; Gready JE
J Comput Biol; 2004; 11(4):616-25. PubMed ID: 15579234
[TBL] [Abstract][Full Text] [Related]
13. A space-efficient algorithm for the constrained pairwise sequence alignment problem.
He D; Arslan AN
Genome Inform; 2005; 16(2):237-46. PubMed ID: 16901106
[TBL] [Abstract][Full Text] [Related]
14. A local alignment metric for accelerating biosequence database search.
Spiro PA; Macura N
J Comput Biol; 2004; 11(1):61-82. PubMed ID: 15072689
[TBL] [Abstract][Full Text] [Related]
15. Optimally separating sequences.
Myers G
Genome Inform; 2001; 12():165-74. PubMed ID: 11791235
[TBL] [Abstract][Full Text] [Related]
16. Rapid significance estimation in local sequence alignment with gaps.
Bundschuh R
J Comput Biol; 2002; 9(2):243-60. PubMed ID: 12015880
[TBL] [Abstract][Full Text] [Related]
17. VISTA family of computational tools for comparative analysis of DNA sequences and whole genomes.
Dubchak I; Ryaboy DV
Methods Mol Biol; 2006; 338():69-89. PubMed ID: 16888351
[TBL] [Abstract][Full Text] [Related]
18. Calculating the SNP-effective sample size from an alignment.
Haubold B; Wiehe T
Bioinformatics; 2002 Jan; 18(1):36-8. PubMed ID: 11836209
[TBL] [Abstract][Full Text] [Related]
19. Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences.
Forêt S; Kantorovitz MR; Burden CJ
BMC Bioinformatics; 2006 Dec; 7 Suppl 5(Suppl 5):S21. PubMed ID: 17254306
[TBL] [Abstract][Full Text] [Related]
20. Provably sensitive indexing strategies for biosequence similarity search.
Buhler J
J Comput Biol; 2003; 10(3-4):399-417. PubMed ID: 13677335
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
