BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

173 related articles for article (PubMed ID: 24152242)

  • 1. Compact representation of k-mer de Bruijn graphs for genome read assembly.
    Rødland EA
    BMC Bioinformatics; 2013 Oct; 14():313. PubMed ID: 24152242
    [TBL] [Abstract][Full Text] [Related]  

  • 2. A space and time-efficient index for the compacted colored de Bruijn graph.
    Almodaresi F; Sarkar H; Srivastava A; Patro R
    Bioinformatics; 2018 Jul; 34(13):i169-i177. PubMed ID: 29949982
    [TBL] [Abstract][Full Text] [Related]  

  • 3. 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]  

  • 4. 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]  

  • 5. 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]  

  • 6. deBGR: an efficient and near-exact representation of the weighted de Bruijn graph.
    Pandey P; Bender MA; Johnson R; Patro R
    Bioinformatics; 2017 Jul; 33(14):i133-i141. PubMed ID: 28881995
    [TBL] [Abstract][Full Text] [Related]  

  • 7. 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]  

  • 8. 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]  

  • 9. Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphs.
    Limasset A; Flot JF; Peterlongo P
    Bioinformatics; 2020 Mar; 36(5):1374-1381. PubMed ID: 30785192
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Lossless indexing with counting de Bruijn graphs.
    Karasikov M; Mustafa H; Rätsch G; Kahles A
    Genome Res; 2022 May; 32(9):1754-64. PubMed ID: 35609994
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Enhanced Compression of
    Rossignolo E; Comin M
    J Comput Biol; 2024 Jun; 31(6):524-538. PubMed ID: 38820168
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Bloom Filter Trie: an alignment-free and reference-free data structure for pan-genome storage.
    Holley G; Wittler R; Stoye J
    Algorithms Mol Biol; 2016; 11():3. PubMed ID: 27087830
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Accurate determination of node and arc multiplicities in de bruijn graphs using conditional random fields.
    Steyaert A; Audenaert P; Fostier J
    BMC Bioinformatics; 2020 Sep; 21(1):402. PubMed ID: 32928110
    [TBL] [Abstract][Full Text] [Related]  

  • 14. 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]  

  • 15. 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]  

  • 16. Compression Algorithm for Colored de Bruijn Graphs.
    Rahman A; Dufresne Y; Medvedev P
    Lebniz Int Proc Inform; 2023 Sep; 273():. PubMed ID: 38712341
    [TBL] [Abstract][Full Text] [Related]  

  • 17. 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]  

  • 18. 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]  

  • 19. Efficient Colored de Bruijn Graph for Indexing Reads.
    Hasegawa N; Shimizu K
    J Comput Biol; 2023 Jun; 30(6):648-662. PubMed ID: 37115583
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Pan-genome de Bruijn graph using the bidirectional FM-index.
    Depuydt L; Renders L; Abeel T; Fostier J
    BMC Bioinformatics; 2023 Oct; 24(1):400. PubMed ID: 37884897
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.