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 *

119 related articles for article (PubMed ID: 36824947)

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

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

  • 23. RMI-DBG algorithm: A more agile iterative de Bruijn graph algorithm in short read genome assembly.
    Hosseini ZZ; Rahimi SK; Forouzan E; Baraani A
    J Bioinform Comput Biol; 2021 Apr; 19(2):2150005. PubMed ID: 33866959
    [TBL] [Abstract][Full Text] [Related]  

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

  • 25. On weighted k-mer dictionaries.
    Pibiri GE
    Algorithms Mol Biol; 2023 Jun; 18(1):3. PubMed ID: 37328897
    [TBL] [Abstract][Full Text] [Related]  

  • 26. The K-mer File Format: a standardized and compact disk representation of sets of k-mers.
    Dufresne Y; Lemane T; Marijon P; Peterlongo P; Rahman A; Kokot M; Medvedev P; Deorowicz S; Chikhi R
    Bioinformatics; 2022 Sep; 38(18):4423-4425. PubMed ID: 35904548
    [TBL] [Abstract][Full Text] [Related]  

  • 27. On the Maximal Independent Sets of
    Ma L; Chen K; Shao M
    ACM BCB; 2023 Sep; 2023():. PubMed ID: 38050580
    [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. 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]  

  • 30. A new method to compute K-mer frequencies and its application to annotate large repetitive plant genomes.
    Kurtz S; Narechania A; Stein JC; Ware D
    BMC Genomics; 2008 Oct; 9():517. PubMed ID: 18976482
    [TBL] [Abstract][Full Text] [Related]  

  • 31. K-mer clustering algorithm using a MapReduce framework: application to the parallelization of the Inchworm module of Trinity.
    Kim CS; Winn MD; Sachdeva V; Jordan KE
    BMC Bioinformatics; 2017 Nov; 18(1):467. PubMed ID: 29100493
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Optimized Sequence Library Design for Efficient In Vitro Interaction Mapping.
    Orenstein Y; Puccinelli R; Kim R; Fordyce P; Berger B
    Cell Syst; 2017 Sep; 5(3):230-236.e5. PubMed ID: 28957657
    [TBL] [Abstract][Full Text] [Related]  

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

  • 34. Fulgor: a fast and compact k-mer index for large-scale matching and color queries.
    Fan J; Khan J; Singh NP; Pibiri GE; Patro R
    Algorithms Mol Biol; 2024 Jan; 19(1):3. PubMed ID: 38254124
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Efficient minimizer orders for large values of
    Pellow D; Pu L; Ekim B; Kotlar L; Berger B; Shamir R; Orenstein Y
    Genome Res; 2023 Jul; 33(7):1154-1161. PubMed ID: 37558282
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Optimization of de novo transcriptome assembly from high-throughput short read sequencing data improves functional annotation for non-model organisms.
    Haznedaroglu BZ; Reeves D; Rismani-Yazdi H; Peccia J
    BMC Bioinformatics; 2012 Jul; 13():170. PubMed ID: 22808927
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Efficient Design of Compact Unstructured RNA Libraries Covering All k-mers.
    Orenstein Y; Berger B
    J Comput Biol; 2016 Feb; 23(2):67-79. PubMed ID: 26713687
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Where the patterns are: repetition-aware compression for colored de Bruijn graphs
    Campanelli A; Pibiri GE; Fan J; Patro R
    bioRxiv; 2024 Jul; ():. PubMed ID: 39026859
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Space-efficient representation of genomic k-mer count tables.
    Shibuya Y; Belazzougui D; Kucherov G
    Algorithms Mol Biol; 2022 Mar; 17(1):5. PubMed ID: 35317833
    [TBL] [Abstract][Full Text] [Related]  

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

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