BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

210 related articles for article (PubMed ID: 27659452)

  • 1. TwoPaCo: an efficient algorithm to build the compacted de Bruijn graph from many complete genomes.
    Minkin I; Pham S; Medvedev P
    Bioinformatics; 2017 Dec; 33(24):4024-4032. PubMed ID: 27659452
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. StLiter: A Novel Algorithm to Iteratively Build the Compacted de Bruijn Graph From Many Complete Genomes.
    Yu C; Mao K; Zhao Y; Chang C; Wang G
    IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(4):2471-2483. PubMed ID: 33630738
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 6. deBWT: parallel construction of Burrows-Wheeler Transform for large collection of genomes with de Bruijn-branch encoding.
    Liu B; Zhu D; Wang Y
    Bioinformatics; 2016 Jun; 32(12):i174-i182. PubMed ID: 27307614
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 10. Scalable, ultra-fast, and low-memory construction of compacted de Bruijn graphs with Cuttlefish 2.
    Khan J; Kokot M; Deorowicz S; Patro R
    Genome Biol; 2022 Sep; 23(1):190. PubMed ID: 36076275
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. Succinct colored de Bruijn graphs.
    Muggli MD; Bowe A; Noyes NR; Morley PS; Belk KE; Raymond R; Gagie T; Puglisi SJ; Boucher C
    Bioinformatics; 2017 Oct; 33(20):3181-3187. PubMed ID: 28200001
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. Population-scale detection of non-reference sequence variants using colored de Bruijn graphs.
    Krannich T; White WTJ; Niehus S; Holley G; Halldórsson BV; Kehr B
    Bioinformatics; 2022 Jan; 38(3):604-611. PubMed ID: 34726732
    [TBL] [Abstract][Full Text] [Related]  

  • 15. ntCard: a streaming algorithm for cardinality estimation in genomics data.
    Mohamadi H; Khan H; Birol I
    Bioinformatics; 2017 May; 33(9):1324-1330. PubMed ID: 28453674
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 18. Unbiased pangenome graphs.
    Garrison E; Guarracino A
    Bioinformatics; 2023 Jan; 39(1):. PubMed ID: 36448683
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Constructing small genome graphs via string compression.
    Qiu Y; Kingsford C
    Bioinformatics; 2021 Jul; 37(Suppl_1):i205-i213. PubMed ID: 34252955
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Aligning optical maps to de Bruijn graphs.
    Mukherjee K; Alipanahi B; Kahveci T; Salmela L; Boucher C
    Bioinformatics; 2019 Sep; 35(18):3250-3256. PubMed ID: 30698651
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 11.