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 *

192 related articles for article (PubMed ID: 36448683)

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

  • 2. ODGI: understanding pangenome graphs.
    Guarracino A; Heumos S; Nahnsen S; Prins P; Garrison E
    Bioinformatics; 2022 Jun; 38(13):3319-3326. PubMed ID: 35552372
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Panacus: fast and exact pangenome growth and core size estimation.
    Parmigiani L; Garrison E; Stoye J; Marschall T; Doerr D
    bioRxiv; 2024 Jun; ():. PubMed ID: 38915671
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Pangenome graph layout by Path-Guided Stochastic Gradient Descent.
    Heumos S; Guarracino A; Schmelzle JM; Li J; Zhang Z; Hagmann J; Nahnsen S; Prins P; Garrison E
    Bioinformatics; 2024 Jul; 40(7):. PubMed ID: 38960860
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. Comparing methods for constructing and representing human pangenome graphs.
    Andreace F; Lechat P; Dufresne Y; Chikhi R
    Genome Biol; 2023 Nov; 24(1):274. PubMed ID: 38037131
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Cluster-efficient pangenome graph construction with nf-core/pangenome.
    Heumos S; Heuer ML; Hanssen F; Heumos L; Guarracino A; Heringer P; Ehmele P; Prins P; Garrison E; Nahnsen S
    Bioinformatics; 2024 Nov; 40(11):. PubMed ID: 39400346
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. GraphAligner: rapid and versatile sequence-to-graph alignment.
    Rautiainen M; Marschall T
    Genome Biol; 2020 Sep; 21(1):253. PubMed ID: 32972461
    [TBL] [Abstract][Full Text] [Related]  

  • 10. PanKmer: k-mer-based and reference-free pangenome analysis.
    Aylward AJ; Petrus S; Mamerto A; Hartwick NT; Michael TP
    Bioinformatics; 2023 Oct; 39(10):. PubMed ID: 37846049
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Detecting high-scoring local alignments in pangenome graphs.
    Schulz T; Wittler R; Rahmann S; Hach F; Stoye J
    Bioinformatics; 2021 Aug; 37(16):2266-2274. PubMed ID: 33532821
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Efficient short read mapping to a pangenome that is represented by a graph of ED strings.
    Büchler T; Olbrich J; Ohlebusch E
    Bioinformatics; 2023 May; 39(5):. PubMed ID: 37171844
    [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. Haplotype-aware sequence alignment to pangenome graphs.
    Chandra G; Gibney D; Jain C
    Genome Res; 2024 Oct; 34(9):1265-1275. PubMed ID: 39013594
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. Pangenome graph layout by Path-Guided Stochastic Gradient Descent.
    Heumos S; Guarracino A; Schmelzle JM; Li J; Zhang Z; Hagmann J; Nahnsen S; Prins P; Garrison E
    bioRxiv; 2023 Oct; ():. PubMed ID: 37790531
    [TBL] [Abstract][Full Text] [Related]  

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

  • 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. Efficient dynamic variation graphs.
    Eizenga JM; Novak AM; Kobayashi E; Villani F; Cisar C; Heumos S; Hickey G; Colonna V; Paten B; Garrison E
    Bioinformatics; 2021 Jan; 36(21):5139-5144. PubMed ID: 33040146
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Co-linear chaining on pangenome graphs.
    Rajput J; Chandra G; Jain C
    Algorithms Mol Biol; 2024 Jan; 19(1):4. PubMed ID: 38279113
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.