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 *

258 related articles for article (PubMed ID: 33823902)

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

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

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

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

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

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

  • 7. An Efficient, Scalable, and Exact Representation of High-Dimensional Color Information Enabled Using de Bruijn Graph Search.
    Almodaresi F; Pandey P; Ferdman M; Johnson R; Patro R
    J Comput Biol; 2020 Apr; 27(4):485-499. PubMed ID: 32176522
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Graphical pan-genome analysis with compressed suffix trees and the Burrows-Wheeler transform.
    Baier U; Beller T; Ohlebusch E
    Bioinformatics; 2016 Feb; 32(4):497-504. PubMed ID: 26504144
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Efficient de novo assembly of large genomes using compressed data structures.
    Simpson JT; Durbin R
    Genome Res; 2012 Mar; 22(3):549-56. PubMed ID: 22156294
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

  • 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. Representation of
    Rahman A; Medevedev P
    J Comput Biol; 2021 Apr; 28(4):381-394. PubMed ID: 33290137
    [No Abstract]   [Full Text] [Related]  

  • 17. On the representation of de Bruijn graphs.
    Chikhi R; Limasset A; Jackman S; Simpson JT; Medvedev P
    J Comput Biol; 2015 May; 22(5):336-52. PubMed ID: 25629448
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Building large updatable colored de Bruijn graphs via merging.
    Muggli MD; Alipanahi B; Boucher C
    Bioinformatics; 2019 Jul; 35(14):i51-i60. PubMed ID: 31510647
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. Bifrost: highly parallel construction and indexing of colored and compacted de Bruijn graphs.
    Holley G; Melsted P
    Genome Biol; 2020 Sep; 21(1):249. PubMed ID: 32943081
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 13.