145 related articles for article (PubMed ID: 25282047)
1. An algorithm of discovering signatures from DNA databases on a computer cluster.
Lee HP; Sheu TF
BMC Bioinformatics; 2014 Oct; 15(1):339. PubMed ID: 25282047
[TBL] [Abstract][Full Text] [Related]
2. A parallel and incremental algorithm for efficient unique signature discovery on DNA databases.
Lee HP; Sheu TF; Tang CY
BMC Bioinformatics; 2010 Mar; 11():132. PubMed ID: 20230647
[TBL] [Abstract][Full Text] [Related]
3. ERGC: an efficient referential genome compression algorithm.
Saha S; Rajasekaran S
Bioinformatics; 2015 Nov; 31(21):3468-75. PubMed ID: 26139636
[TBL] [Abstract][Full Text] [Related]
4. Parallel hash-based EST clustering algorithm for gene sequencing.
Mudhireddy R; Ercal F; Frank R
DNA Cell Biol; 2004 Oct; 23(10):615-23. PubMed ID: 15585119
[TBL] [Abstract][Full Text] [Related]
5. HTSFinder: Powerful Pipeline of DNA Signature Discovery by Parallel and Distributed Computing.
Karimi R; Hajdu A
Evol Bioinform Online; 2016; 12():73-85. PubMed ID: 26884678
[TBL] [Abstract][Full Text] [Related]
6. CLAST: CUDA implemented large-scale alignment search tool.
Yano M; Mori H; Akiyama Y; Yamada T; Kurokawa K
BMC Bioinformatics; 2014 Dec; 15(1):406. PubMed ID: 25495907
[TBL] [Abstract][Full Text] [Related]
7. A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays.
Khan Z; Bloom JS; Kruglyak L; Singh M
Bioinformatics; 2009 Jul; 25(13):1609-16. PubMed ID: 19389736
[TBL] [Abstract][Full Text] [Related]
8. HBLAST: Parallelised sequence similarity--A Hadoop MapReducable basic local alignment search tool.
O'Driscoll A; Belogrudov V; Carroll J; Kropp K; Walsh P; Ghazal P; Sleator RD
J Biomed Inform; 2015 Apr; 54():58-64. PubMed ID: 25625550
[TBL] [Abstract][Full Text] [Related]
9. NRGC: a novel referential genome compression algorithm.
Saha S; Rajasekaran S
Bioinformatics; 2016 Nov; 32(22):3405-3412. PubMed ID: 27485445
[TBL] [Abstract][Full Text] [Related]
10. Read-Split-Run: an improved bioinformatics pipeline for identification of genome-wide non-canonical spliced regions using RNA-Seq data.
Bai Y; Kinne J; Donham B; Jiang F; Ding L; Hassler JR; Kaufman RJ
BMC Genomics; 2016 Aug; 17 Suppl 7(Suppl 7):503. PubMed ID: 27556805
[TBL] [Abstract][Full Text] [Related]
11. Fast discovery and visualization of conserved regions in DNA sequences using quasi-alignment.
Nagar A; Hahsler M
BMC Bioinformatics; 2013; 14 Suppl 11(Suppl 11):S2. PubMed ID: 24564200
[TBL] [Abstract][Full Text] [Related]
12. Towards a HPC-oriented parallel implementation of a learning algorithm for bioinformatics applications.
D'Angelo G; Rampone S
BMC Bioinformatics; 2014; 15 Suppl 5(Suppl 5):S2. PubMed ID: 25077818
[TBL] [Abstract][Full Text] [Related]
13. CLU: a new algorithm for EST clustering.
Ptitsyn A; Hide W
BMC Bioinformatics; 2005 Jul; 6 Suppl 2(Suppl 2):S3. PubMed ID: 16026600
[TBL] [Abstract][Full Text] [Related]
14. A parallel algorithm for error correction in high-throughput short-read data on CUDA-enabled graphics hardware.
Shi H; Schmidt B; Liu W; Müller-Wittig W
J Comput Biol; 2010 Apr; 17(4):603-15. PubMed ID: 20426693
[TBL] [Abstract][Full Text] [Related]
15. A fast algorithm for exact sequence search in biological sequences using polyphase decomposition.
Srikantha A; Bopardikar AS; Kaipa KK; Venkataraman P; Lee K; Ahn T; Narayanan R
Bioinformatics; 2010 Sep; 26(18):i414-9. PubMed ID: 20823301
[TBL] [Abstract][Full Text] [Related]
16. WinHAP2: an extremely fast haplotype phasing program for long genotype sequences.
Pan W; Zhao Y; Xu Y; Zhou F
BMC Bioinformatics; 2014 May; 15():164. PubMed ID: 24884701
[TBL] [Abstract][Full Text] [Related]
17. Next-generation VariationHunter: combinatorial algorithms for transposon insertion discovery.
Hormozdiari F; Hajirasouliha I; Dao P; Hach F; Yorukoglu D; Alkan C; Eichler EE; Sahinalp SC
Bioinformatics; 2010 Jun; 26(12):i350-7. PubMed ID: 20529927
[TBL] [Abstract][Full Text] [Related]
18. IncMD: incremental trie-based structural motif discovery algorithm.
Badr G; Al-Turaiki I; Turcotte M; Mathkour H
J Bioinform Comput Biol; 2014 Oct; 12(5):1450027. PubMed ID: 25362841
[TBL] [Abstract][Full Text] [Related]
19. A new algorithm for DNA motif discovery using multiple sample sequence sets.
Yu Q; Zhao X; Huo H
J Bioinform Comput Biol; 2019 Aug; 17(4):1950021. PubMed ID: 31617465
[TBL] [Abstract][Full Text] [Related]
20. Implementing EM and Viterbi algorithms for Hidden Markov Model in linear memory.
Churbanov A; Winters-Hilt S
BMC Bioinformatics; 2008 Apr; 9():224. PubMed ID: 18447951
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
