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 *

189 related articles for article (PubMed ID: 25572416)

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

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

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

  • 24. Minimizer-space de Bruijn graphs: Whole-genome assembly of long reads in minutes on a personal computer.
    Ekim B; Berger B; Chikhi R
    Cell Syst; 2021 Oct; 12(10):958-968.e6. PubMed ID: 34525345
    [TBL] [Abstract][Full Text] [Related]  

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

  • 26. A representation of a compressed de Bruijn graph for pan-genome analysis that enables search.
    Beller T; Ohlebusch E
    Algorithms Mol Biol; 2016; 11():20. PubMed ID: 27437028
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Buffering updates enables efficient dynamic de Bruijn graphs.
    Alanko J; Alipanahi B; Settle J; Boucher C; Gagie T
    Comput Struct Biotechnol J; 2021; 19():4067-4078. PubMed ID: 34377371
    [TBL] [Abstract][Full Text] [Related]  

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

  • 29. BubbleGun: enumerating bubbles and superbubbles in genome graphs.
    Dabbaghie F; Ebler J; Marschall T
    Bioinformatics; 2022 Sep; 38(17):4217-4219. PubMed ID: 35799353
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 32. Techniques for multi-genome synteny analysis to overcome assembly limitations.
    Bhutkar A; Russo S; Smith TF; Gelbart WM
    Genome Inform; 2006; 17(2):152-61. PubMed ID: 17503388
    [TBL] [Abstract][Full Text] [Related]  

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

  • 34. On the distribution of the number of cycles in the breakpoint graph of a random signed permutation.
    Grusea S
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1411-6. PubMed ID: 21116045
    [TBL] [Abstract][Full Text] [Related]  

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

  • 36. Bit-parallel sequence-to-graph alignment.
    Rautiainen M; Mäkinen V; Marschall T
    Bioinformatics; 2019 Oct; 35(19):3599-3607. PubMed ID: 30851095
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Genome rearrangements in mammalian evolution: lessons from human and mouse genomes.
    Pevzner P; Tesler G
    Genome Res; 2003 Jan; 13(1):37-45. PubMed ID: 12529304
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Moments of genome evolution by Double Cut-and-Join.
    Biller P; Guéguen L; Tannier E
    BMC Bioinformatics; 2015; 16 Suppl 14(Suppl 14):S7. PubMed ID: 26451469
    [TBL] [Abstract][Full Text] [Related]  

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

  • 40. GRIDSS: sensitive and specific genomic rearrangement detection using positional de Bruijn graph assembly.
    Cameron DL; Schröder J; Penington JS; Do H; Molania R; Dobrovic A; Speed TP; Papenfuss AT
    Genome Res; 2017 Dec; 27(12):2050-2060. PubMed ID: 29097403
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 10.