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 *

110 related articles for article (PubMed ID: 39108943)

  • 1. Space-time Trade-offs for the LCP Array of Wheeler DFAs.
    Cotumaccio N; Gagie T; Köppl D; Prezza N
    Int Symp String Process Inf Retr; 2023 Sep; 14240():143-156. PubMed ID: 39108943
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Computing matching statistics on Wheeler DFAs.
    Conte A; Cotumaccio N; Gagie T; Manzini G; Prezza N; Sciortino M
    Proc Data Compress Conf; 2023 Mar; 2023():150-159. PubMed ID: 38832320
    [TBL] [Abstract][Full Text] [Related]  

  • 3. External memory BWT and LCP computation for sequence collections with applications.
    Egidi L; Louza FA; Manzini G; Telles GP
    Algorithms Mol Biol; 2019; 14():6. PubMed ID: 30899322
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

  • 8. Wheeler graphs: A framework for BWT-based data structures.
    Gagie T; Manzini G; Sirén J
    Theor Comput Sci; 2017 Oct; 698():67-78. PubMed ID: 29276331
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Multithread Multistring Burrows-Wheeler Transform and Longest Common Prefix Array.
    Bonizzoni P; Della Vedova G; Pirola Y; Previtali M; Rizzi R
    J Comput Biol; 2019 Sep; 26(9):948-961. PubMed ID: 31140836
    [No Abstract]   [Full Text] [Related]  

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

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

  • 12. gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections.
    Louza FA; Telles GP; Gog S; Prezza N; Rosone G
    Algorithms Mol Biol; 2020; 15():18. PubMed ID: 32973918
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 16. A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly.
    Dinh H; Rajasekaran S
    Bioinformatics; 2011 Jul; 27(14):1901-7. PubMed ID: 21636593
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 20. Variable-order reference-free variant discovery with the Burrows-Wheeler Transform.
    Prezza N; Pisanti N; Sciortino M; Rosone G
    BMC Bioinformatics; 2020 Sep; 21(Suppl 8):260. PubMed ID: 32938358
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.