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