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.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

567 related articles for article (PubMed ID: 21078174)

  • 1. Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.
    Kundeti VK; Rajasekaran S; Dinh H; Vaughn M; Thapar V
    BMC Bioinformatics; 2010 Nov; 11():560. PubMed ID: 21078174
    [TBL] [Abstract][Full Text] [Related]  

  • 2. AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS.
    Kundeti V; Rajasekaran S; Dinh H
    Discrete Math Algorithms Appl; 2010; 1():184-196. PubMed ID: 25364472
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Fast de Bruijn Graph Compaction in Distributed Memory Environments.
    Pan T; Nihalani R; Aluru S
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(1):136-148. PubMed ID: 30072337
    [TBL] [Abstract][Full Text] [Related]  

  • 4. On the Hardness of Sequence Alignment on De Bruijn Graphs.
    Gibney D; Thankachan SV; Aluru S
    J Comput Biol; 2022 Dec; 29(12):1377-1396. PubMed ID: 36450127
    [TBL] [Abstract][Full Text] [Related]  

  • 5. FastEtch: A Fast Sketch-Based Assembler for Genomes.
    Ghosh P; Kalyanaraman A
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1091-1106. PubMed ID: 28910776
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Velvet: algorithms for de novo short read assembly using de Bruijn graphs.
    Zerbino DR; Birney E
    Genome Res; 2008 May; 18(5):821-9. PubMed ID: 18349386
    [TBL] [Abstract][Full Text] [Related]  

  • 7. HyDA-Vista: towards optimal guided selection of k-mer size for sequence assembly.
    Shariat B; Movahedi NS; Chitsaz H; Boucher C
    BMC Genomics; 2014; 15 Suppl 10(Suppl 10):S9. PubMed ID: 25558875
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Integrating long-range connectivity information into de Bruijn graphs.
    Turner I; Garimella KV; Iqbal Z; McVean G
    Bioinformatics; 2018 Aug; 34(15):2556-2565. PubMed ID: 29554215
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Benchmarking of de novo assembly algorithms for Nanopore data reveals optimal performance of OLC approaches.
    Cherukuri Y; Janga SC
    BMC Genomics; 2016 Aug; 17 Suppl 7(Suppl 7):507. PubMed ID: 27556636
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Read mapping on de Bruijn graphs.
    Limasset A; Cazaux B; Rivals E; Peterlongo P
    BMC Bioinformatics; 2016 Jun; 17(1):237. PubMed ID: 27306641
    [TBL] [Abstract][Full Text] [Related]  

  • 11. MegaGTA: a sensitive and accurate metagenomic gene-targeted assembler using iterative de Bruijn graphs.
    Li D; Huang Y; Leung CM; Luo R; Ting HF; Lam TW
    BMC Bioinformatics; 2017 Oct; 18(Suppl 12):408. PubMed ID: 29072142
    [TBL] [Abstract][Full Text] [Related]  

  • 12. BrownieAligner: accurate alignment of Illumina sequencing data to de Bruijn graphs.
    Heydari M; Miclotte G; Van de Peer Y; Fostier J
    BMC Bioinformatics; 2018 Sep; 19(1):311. PubMed ID: 30180801
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Cuttlefish: fast, parallel and low-memory compaction of de Bruijn graphs from large-scale genome collections.
    Khan J; Patro R
    Bioinformatics; 2021 Jul; 37(Suppl_1):i177-i186. PubMed ID: 34252958
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Assembly of long error-prone reads using de Bruijn graphs.
    Lin Y; Yuan J; Kolmogorov M; Shen MW; Chaisson M; Pevzner PA
    Proc Natl Acad Sci U S A; 2016 Dec; 113(52):E8396-E8405. PubMed ID: 27956617
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Compacting de Bruijn graphs from sequencing data quickly and in low memory.
    Chikhi R; Limasset A; Medvedev P
    Bioinformatics; 2016 Jun; 32(12):i201-i208. PubMed ID: 27307618
    [TBL] [Abstract][Full Text] [Related]  

  • 16. RResolver: efficient short-read repeat resolution within ABySS.
    Nikolić V; Afshinfard A; Chu J; Wong J; Coombe L; Nip KM; Warren RL; Birol I
    BMC Bioinformatics; 2022 Jun; 23(1):246. PubMed ID: 35729491
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Simplitigs as an efficient and scalable representation of de Bruijn graphs.
    Břinda K; Baym M; Kucherov G
    Genome Biol; 2021 Apr; 22(1):96. PubMed ID: 33823902
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Efficient construction of an assembly string graph using the FM-index.
    Simpson JT; Durbin R
    Bioinformatics; 2010 Jun; 26(12):i367-73. PubMed ID: 20529929
    [TBL] [Abstract][Full Text] [Related]  

  • 19. deGSM: Memory Scalable Construction Of Large Scale de Bruijn Graph.
    Guo H; Fu Y; Gao Y; Li J; Wang Y; Liu B
    IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2157-2166. PubMed ID: 31056509
    [TBL] [Abstract][Full Text] [Related]  

  • 20. An efficient algorithm for DNA fragment assembly in MapReduce.
    Xu B; Gao J; Li C
    Biochem Biophys Res Commun; 2012 Sep; 426(3):395-8. PubMed ID: 22960169
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 29.