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.
100 related articles for article (PubMed ID: 31995404)
1. Reverse de Bruijn: Utilizing Reverse Peptide Synthesis to Cover All Amino Acid Orenstein Y J Comput Biol; 2020 Mar; 27(3):376-385. PubMed ID: 31995404 [No Abstract] [Full Text] [Related]
2. Joker de Bruijn: Covering k-Mers Using Joker Characters. Orenstein Y; Yu YW; Berger B J Comput Biol; 2018 Nov; 25(11):1171-1178. PubMed ID: 30117747 [TBL] [Abstract][Full Text] [Related]
3. Design of shortest double-stranded DNA sequences covering all k-mers with applications to protein-binding microarrays and synthetic enhancers. Orenstein Y; Shamir R Bioinformatics; 2013 Jul; 29(13):i71-9. PubMed ID: 23813011 [TBL] [Abstract][Full Text] [Related]
4. 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]
7. 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]
8. Sketching Methods with Small Window Guarantee Using Minimum Decycling Sets. Marçais G; DeBlasio D; Kingsford C J Comput Biol; 2024 Jul; 31(7):597-615. PubMed ID: 38980804 [TBL] [Abstract][Full Text] [Related]
9. KMC 2: fast and resource-frugal k-mer counting. Deorowicz S; Kokot M; Grabowski S; Debudaj-Grabysz A Bioinformatics; 2015 May; 31(10):1569-76. PubMed ID: 25609798 [TBL] [Abstract][Full Text] [Related]
10. Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time. Schmidt S; Alanko JN Algorithms Mol Biol; 2023 Jul; 18(1):5. PubMed ID: 37403080 [TBL] [Abstract][Full Text] [Related]
11. 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]
12. Compression Algorithm for Colored de Bruijn Graphs. Rahman A; Dufresne Y; Medvedev P Lebniz Int Proc Inform; 2023 Sep; 273():. PubMed ID: 38712341 [TBL] [Abstract][Full Text] [Related]
13. Accurate determination of node and arc multiplicities in de bruijn graphs using conditional random fields. Steyaert A; Audenaert P; Fostier J BMC Bioinformatics; 2020 Sep; 21(1):402. PubMed ID: 32928110 [TBL] [Abstract][Full Text] [Related]
14. The Statistics of Blanca A; Harris RS; Koslicki D; Medvedev P J Comput Biol; 2022 Feb; 29(2):155-168. PubMed ID: 35108101 [No Abstract] [Full Text] [Related]
16. Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time. Schmidt S; Alanko JN Res Sq; 2023 Feb; ():. PubMed ID: 36824947 [TBL] [Abstract][Full Text] [Related]
17. Set-Min Sketch: A Probabilistic Map for Power-Law Distributions with Application to Shibuya Y; Belazzougui D; Kucherov G J Comput Biol; 2022 Feb; 29(2):140-154. PubMed ID: 35049334 [No Abstract] [Full Text] [Related]
18. Fulgor: A fast and compact Fan J; Singh NP; Khan J; Pibiri GE; Patro R bioRxiv; 2023 May; ():. PubMed ID: 37214944 [TBL] [Abstract][Full Text] [Related]
19. In silico read normalization using set multi-cover optimization. Durai DA; Schulz MH Bioinformatics; 2018 Oct; 34(19):3273-3280. PubMed ID: 29912280 [TBL] [Abstract][Full Text] [Related]
20. 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] [Next] [New Search]