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 *

208 related articles for article (PubMed ID: 25572416)

  • 1. What is the difference between the breakpoint graph and the de Bruijn graph?
    Lin Y; Nurk S; Pevzner PA
    BMC Genomics; 2014; 15 Suppl 6(Suppl 6):S6. PubMed ID: 25572416
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Colored de Bruijn graphs and the genome halving problem.
    Alekseyev MA; Pevzner PA
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(1):98-107. PubMed ID: 17277417
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. Assembly of long error-prone reads using de Bruijn graphs.
    Lin Y; Yuan J; Kolmogorov M; Shen MW; Chaisson M; Pevzner PA
    Proc Natl Acad Sci U S A; 2016 Dec; 113(52):E8396-E8405. PubMed ID: 27956617
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. Generalized Hultman Numbers and Cycle Structures of Breakpoint Graphs.
    Alexeev N; Pologova A; Alekseyev MA
    J Comput Biol; 2017 Feb; 24(2):93-105. PubMed ID: 28045556
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

  • 13. AGORA: Assembly Guided by Optical Restriction Alignment.
    Lin HC; Goldstein S; Mendelowitz L; Zhou S; Wetzel J; Schwartz DC; Pop M
    BMC Bioinformatics; 2012 Aug; 13():189. PubMed ID: 22856673
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Integration of string and de Bruijn graphs for genome assembly.
    Huang YT; Liao CF
    Bioinformatics; 2016 May; 32(9):1301-7. PubMed ID: 26755626
    [TBL] [Abstract][Full Text] [Related]  

  • 15. SplitMEM: a graphical algorithm for pan-genome analysis with suffix skips.
    Marcus S; Lee H; Schatz MC
    Bioinformatics; 2014 Dec; 30(24):3476-83. PubMed ID: 25398610
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS.
    Kundeti V; Rajasekaran S; Dinh H
    Discrete Math Algorithms Appl; 2010; 1():184-196. PubMed ID: 25364472
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Applications of de Bruijn graphs in microbiome research.
    Dufault-Thompson K; Jiang X
    Imeta; 2022 Mar; 1(1):e4. PubMed ID: 38867733
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Detecting gene breakpoints in noisy genome sequences using position-annotated colored de-Bruijn graphs.
    Fiedler L; Bernt M; Middendorf M; Stadler PF
    BMC Bioinformatics; 2023 Jun; 24(1):235. PubMed ID: 37277700
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Inference of viral quasispecies with a paired de Bruijn graph.
    Freire B; Ladra S; Paramá JR; Salmela L
    Bioinformatics; 2021 May; 37(4):473-481. PubMed ID: 32926162
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 11.