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 *

141 related articles for article (PubMed ID: 35474383)

  • 21. High-quality draft assemblies of mammalian genomes from massively parallel sequence data.
    Gnerre S; Maccallum I; Przybylski D; Ribeiro FJ; Burton JN; Walker BJ; Sharpe T; Hall G; Shea TP; Sykes S; Berlin AM; Aird D; Costello M; Daza R; Williams L; Nicol R; Gnirke A; Nusbaum C; Lander ES; Jaffe DB
    Proc Natl Acad Sci U S A; 2011 Jan; 108(4):1513-8. PubMed ID: 21187386
    [TBL] [Abstract][Full Text] [Related]  

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

  • 23. Kmerind: A Flexible Parallel Library for K-mer Indexing of Biological Sequences on Distributed Memory Systems.
    Pan T; Flick P; Jain C; Liu Y; Aluru S
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1117-1131. PubMed ID: 28991750
    [TBL] [Abstract][Full Text] [Related]  

  • 24. These are not the k-mers you are looking for: efficient online k-mer counting using a probabilistic data structure.
    Zhang Q; Pell J; Canino-Koning R; Howe AC; Brown CT
    PLoS One; 2014; 9(7):e101271. PubMed ID: 25062443
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Fast and efficient short read mapping based on a succinct hash index.
    Zhang H; Chan Y; Fan K; Schmidt B; Liu W
    BMC Bioinformatics; 2018 Mar; 19(1):92. PubMed ID: 29523083
    [TBL] [Abstract][Full Text] [Related]  

  • 26. A general near-exact k-mer counting method with low memory consumption enables de novo assembly of 106× human sequence data in 2.7 hours.
    Shi CH; Yip KY
    Bioinformatics; 2020 Dec; 36(Suppl_2):i625-i633. PubMed ID: 33381843
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Refined repetitive sequence searches utilizing a fast hash function and cross species information retrievals.
    Reneker J; Shyu CR
    BMC Bioinformatics; 2005 May; 6():111. PubMed ID: 15869708
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Positional bias in variant calls against draft reference assemblies.
    Briskine RV; Shimizu KK
    BMC Genomics; 2017 Mar; 18(1):263. PubMed ID: 28351369
    [TBL] [Abstract][Full Text] [Related]  

  • 29. A fast algorithm for exact sequence search in biological sequences using polyphase decomposition.
    Srikantha A; Bopardikar AS; Kaipa KK; Venkataraman P; Lee K; Ahn T; Narayanan R
    Bioinformatics; 2010 Sep; 26(18):i414-9. PubMed ID: 20823301
    [TBL] [Abstract][Full Text] [Related]  

  • 30. GenomeQC: a quality assessment tool for genome assemblies and gene structure annotations.
    Manchanda N; Portwood JL; Woodhouse MR; Seetharam AS; Lawrence-Dill CJ; Andorf CM; Hufford MB
    BMC Genomics; 2020 Mar; 21(1):193. PubMed ID: 32122303
    [TBL] [Abstract][Full Text] [Related]  

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

  • 32. MICA: desktop software for comprehensive searching of DNA databases.
    Stokes WA; Glick BS
    BMC Bioinformatics; 2006 Oct; 7():427. PubMed ID: 17018144
    [TBL] [Abstract][Full Text] [Related]  

  • 33. TruMatch--a BLAST post-processor that identifies bona fide sequence matches to genome assemblies.
    Li W; Rehmeyer CJ; Staben C; Farman ML
    Bioinformatics; 2005 May; 21(9):2097-8. PubMed ID: 15671115
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Review of alignment and SNP calling algorithms for next-generation sequencing data.
    Mielczarek M; Szyda J
    J Appl Genet; 2016 Feb; 57(1):71-9. PubMed ID: 26055432
    [TBL] [Abstract][Full Text] [Related]  

  • 35. KCMBT: a k-mer Counter based on Multiple Burst Trees.
    Mamun AA; Pal S; Rajasekaran S
    Bioinformatics; 2016 Sep; 32(18):2783-90. PubMed ID: 27283950
    [TBL] [Abstract][Full Text] [Related]  

  • 36. SRAssembler: Selective Recursive local Assembly of homologous genomic regions.
    McCarthy TW; Chou HC; Brendel VP
    BMC Bioinformatics; 2019 Jul; 20(1):371. PubMed ID: 31266441
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Discovery and genotyping of novel sequence insertions in many sequenced individuals.
    Kavak P; Lin YY; Numanagic I; Asghari H; Güngör T; Alkan C; Hach F
    Bioinformatics; 2017 Jul; 33(14):i161-i169. PubMed ID: 28881988
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Informational and linguistic analysis of large genomic sequence collections via efficient Hadoop cluster algorithms.
    Ferraro Petrillo U; Roscigno G; Cattaneo G; Giancarlo R
    Bioinformatics; 2018 Jun; 34(11):1826-1833. PubMed ID: 29342232
    [TBL] [Abstract][Full Text] [Related]  

  • 39. QuorUM: An Error Corrector for Illumina Reads.
    Marçais G; Yorke JA; Zimin A
    PLoS One; 2015; 10(6):e0130821. PubMed ID: 26083032
    [TBL] [Abstract][Full Text] [Related]  

  • 40. CRAFT: Compact genome Representation toward large-scale Alignment-Free daTabase.
    Lu YY; Bai J; Wang Y; Wang Y; Sun F
    Bioinformatics; 2021 Apr; 37(2):155-161. PubMed ID: 32766810
    [TBL] [Abstract][Full Text] [Related]  

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