172 related articles for article (PubMed ID: 33604186)
1. Syncmers are more sensitive than minimizers for selecting conserved
Edgar R
PeerJ; 2021; 9():e10805. PubMed ID: 33604186
[TBL] [Abstract][Full Text] [Related]
2. Density and Conservation Optimization of the Generalized Masked-Minimizer Sketching Scheme.
Hoang M; Marçais G; Kingsford C
J Comput Biol; 2024 Jan; 31(1):2-20. PubMed ID: 37975802
[TBL] [Abstract][Full Text] [Related]
3. Theory of local k-mer selection with applications to long-read alignment.
Shaw J; Yu YW
Bioinformatics; 2022 Oct; 38(20):4659-4669. PubMed ID: 36124869
[TBL] [Abstract][Full Text] [Related]
4. Improved design and analysis of practical minimizers.
Zheng H; Kingsford C; Marçais G
Bioinformatics; 2020 Jul; 36(Suppl_1):i119-i127. PubMed ID: 32657376
[TBL] [Abstract][Full Text] [Related]
5. 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]
6. Weighted minimizer sampling improves long read mapping.
Jain C; Rhie A; Zhang H; Chu C; Walenz BP; Koren S; Phillippy AM
Bioinformatics; 2020 Jul; 36(Suppl_1):i111-i118. PubMed ID: 32657365
[TBL] [Abstract][Full Text] [Related]
7. Parameterized syncmer schemes improve long-read mapping.
Dutta A; Pellow D; Shamir R
PLoS Comput Biol; 2022 Oct; 18(10):e1010638. PubMed ID: 36306319
[TBL] [Abstract][Full Text] [Related]
8. Improving the performance of minimizers and winnowing schemes.
Marçais G; Pellow D; Bork D; Orenstein Y; Shamir R; Kingsford C
Bioinformatics; 2017 Jul; 33(14):i110-i117. PubMed ID: 28881970
[TBL] [Abstract][Full Text] [Related]
9. Differentiable Learning of Sequence-Specific Minimizer Schemes with DeepMinimizer.
Hoang M; Zheng H; Kingsford C
J Comput Biol; 2022 Dec; 29(12):1288-1304. PubMed ID: 36095142
[TBL] [Abstract][Full Text] [Related]
10. On Minimizers and Convolutional Filters: Theoretical Connections and Applications to Genome Analysis.
Yu YW
J Comput Biol; 2024 May; 31(5):381-395. PubMed ID: 38687333
[No Abstract] [Full Text] [Related]
11. Efficient Seeding for Error-Prone Sequences with SubseqHash2.
Li X; Chen K; Shao M
bioRxiv; 2024 Jun; ():. PubMed ID: 38895288
[TBL] [Abstract][Full Text] [Related]
12. Compact and evenly distributed k-mer binning for genomic sequences.
Nyström-Persson J; Keeble-Gagnère G; Zawad N
Bioinformatics; 2021 Sep; 37(17):2563-2569. PubMed ID: 33693556
[TBL] [Abstract][Full Text] [Related]
13. 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]
14. Asymptotically optimal minimizers schemes.
Marçais G; DeBlasio D; Kingsford C
Bioinformatics; 2018 Jul; 34(13):i13-i22. PubMed ID: 29949995
[TBL] [Abstract][Full Text] [Related]
15. Sequence-specific minimizers via polar sets.
Zheng H; Kingsford C; Marçais G
Bioinformatics; 2021 Jul; 37(Suppl_1):i187-i195. PubMed ID: 34252928
[TBL] [Abstract][Full Text] [Related]
16. 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]
17. Comparing fixed sampling with minimizer sampling when using k-mer indexes to find maximal exact matches.
Almutairy M; Torng E
PLoS One; 2018; 13(2):e0189960. PubMed ID: 29389989
[TBL] [Abstract][Full Text] [Related]
18. A simple refined DNA minimizer operator enables 2-fold faster computation.
Pan C; Reinert K
Bioinformatics; 2024 Feb; 40(2):. PubMed ID: 38269626
[TBL] [Abstract][Full Text] [Related]
19. Data Set-Adaptive Minimizer Order Reduces Memory Usage in
Flomin D; Pellow D; Shamir R
J Comput Biol; 2022 Aug; 29(8):825-838. PubMed ID: 35527644
[TBL] [Abstract][Full Text] [Related]
20. Effective sequence similarity detection with strobemers.
Sahlin K
Genome Res; 2021 Nov; 31(11):2080-2094. PubMed ID: 34667119
[No Abstract] [Full Text] [Related]
[Next] [New Search]
