163 related articles for article (PubMed ID: 25399029)
21. Refined repetitive sequence searches utilizing a fast hash function and cross species information retrievals.
Reneker J; Shyu CR
BMC Bioinformatics; 2005 May; 6():111. PubMed ID: 15869708
[TBL] [Abstract][Full Text] [Related]
22. Multiple organism algorithm for finding ultraconserved elements.
Christley S; Lobo NF; Madey G
BMC Bioinformatics; 2008 Jan; 9():15. PubMed ID: 18186941
[TBL] [Abstract][Full Text] [Related]
23. LTRharvest, an efficient and flexible software for de novo detection of LTR retrotransposons.
Ellinghaus D; Kurtz S; Willhoeft U
BMC Bioinformatics; 2008 Jan; 9():18. PubMed ID: 18194517
[TBL] [Abstract][Full Text] [Related]
24. Fast detection of maximal exact matches via fixed sampling of query K-mers and Bloom filtering of index K-mers.
Liu Y; Zhang LY; Li J
Bioinformatics; 2019 Nov; 35(22):4560-4567. PubMed ID: 30994891
[TBL] [Abstract][Full Text] [Related]
25. MUMmer4: A fast and versatile genome alignment system.
Marçais G; Delcher AL; Phillippy AM; Coston R; Salzberg SL; Zimin A
PLoS Comput Biol; 2018 Jan; 14(1):e1005944. PubMed ID: 29373581
[TBL] [Abstract][Full Text] [Related]
26. PRIMEX: rapid identification of oligonucleotide matches in whole genomes.
Lexa M; Valle G
Bioinformatics; 2003 Dec; 19(18):2486-8. PubMed ID: 14668240
[TBL] [Abstract][Full Text] [Related]
27. Accurate multiple alignment of distantly related genome sequences using filtered spaced word matches as anchor points.
Leimeister CA; Dencker T; Morgenstern B
Bioinformatics; 2019 Jan; 35(2):211-218. PubMed ID: 29992260
[TBL] [Abstract][Full Text] [Related]
28. Efficient computation of absent words in genomic sequences.
Herold J; Kurtz S; Giegerich R
BMC Bioinformatics; 2008 Mar; 9():167. PubMed ID: 18366790
[TBL] [Abstract][Full Text] [Related]
29. MICA: A fast short-read aligner that takes full advantage of Many Integrated Core Architecture (MIC).
Luo R; Cheung J; Wu E; Wang H; Chan SH; Law WC; He G; Yu C; Liu CM; Zhou D; Li Y; Li R; Wang J; Zhu X; Peng S; Lam TW
BMC Bioinformatics; 2015; 16 Suppl 7(Suppl 7):S10. PubMed ID: 25952019
[TBL] [Abstract][Full Text] [Related]
30. Informational and linguistic analysis of large genomic sequence collections via efficient Hadoop cluster algorithms.
Ferraro Petrillo U; Roscigno G; Cattaneo G; Giancarlo R
Bioinformatics; 2018 Jun; 34(11):1826-1833. PubMed ID: 29342232
[TBL] [Abstract][Full Text] [Related]
31. A Long Fragment Aligner called ALFALFA.
Vyverman M; Baets BD; Fack V; Dawyndt P
BMC Bioinformatics; 2015 May; 16(1):159. PubMed ID: 25971785
[TBL] [Abstract][Full Text] [Related]
32. BWA-MEME: BWA-MEM emulated with a machine learning approach.
Jung Y; Han D
Bioinformatics; 2022 Apr; 38(9):2404-2413. PubMed ID: 35253835
[TBL] [Abstract][Full Text] [Related]
33. RACER: Rapid and accurate correction of errors in reads.
Ilie L; Molnar M
Bioinformatics; 2013 Oct; 29(19):2490-3. PubMed ID: 23853064
[TBL] [Abstract][Full Text] [Related]
34. Fast index based algorithms and software for matching position specific scoring matrices.
Beckstette M; Homann R; Giegerich R; Kurtz S
BMC Bioinformatics; 2006 Aug; 7():389. PubMed ID: 16930469
[TBL] [Abstract][Full Text] [Related]
35. Novel definition and algorithm for chaining fragments with proportional overlaps.
Uricaru R; Mancheron A; Rivals E
J Comput Biol; 2011 Sep; 18(9):1141-54. PubMed ID: 21899421
[TBL] [Abstract][Full Text] [Related]
36. Efficient merging of genome profile alignments.
Hennig A; Nieselt K
Bioinformatics; 2019 Jul; 35(14):i71-i80. PubMed ID: 31510683
[TBL] [Abstract][Full Text] [Related]
37. Murasaki: a fast, parallelizable algorithm to find anchors from multiple genomes.
Popendorf K; Tsuyoshi H; Osana Y; Sakakibara Y
PLoS One; 2010 Sep; 5(9):e12651. PubMed ID: 20885980
[TBL] [Abstract][Full Text] [Related]
38. GeCo++: a C++ library for genomic features computation and annotation in the presence of variants.
Cereda M; Sironi M; Cavalleri M; Pozzoli U
Bioinformatics; 2011 May; 27(9):1313-5. PubMed ID: 21398667
[TBL] [Abstract][Full Text] [Related]
39. Rapid and sensitive dot-matrix methods for genome analysis.
Huang Y; Zhang L
Bioinformatics; 2004 Mar; 20(4):460-6. PubMed ID: 14764561
[TBL] [Abstract][Full Text] [Related]
40. SA-SSR: a suffix array-based algorithm for exhaustive and efficient SSR discovery in large genetic sequences.
Pickett BD; Karlinsey SM; Penrod CE; Cormier MJ; Ebbert MT; Shiozawa DK; Whipple CJ; Ridge PG
Bioinformatics; 2016 Sep; 32(17):2707-9. PubMed ID: 27170037
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
