Cargando…
copMEM2: robust and scalable maximum exact match finding
SUMMARY: Finding Maximum Exact Matches, i.e. matches between two strings that cannot be further extended to the left or right, is a classic string problem with applications in genome-to-genome comparisons. The existing tools rarely explicitly address the problem of MEM finding for a pair of very sim...
Autores principales: | Grabowski, Szymon, Bieniecki, Wojciech |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10209524/ https://www.ncbi.nlm.nih.gov/pubmed/37171886 http://dx.doi.org/10.1093/bioinformatics/btad313 |
Ejemplares similares
-
Wright–Fisher exact solver (WFES): scalable analysis of population genetic models without simulation or diffusion theory
por: Krukov, Ivan, et al.
Publicado: (2017) -
RAxML-NG: a fast, scalable and user-friendly tool for maximum likelihood phylogenetic inference
por: Kozlov, Alexey M, et al.
Publicado: (2019) -
CompAIRR: ultra-fast comparison of adaptive immune receptor repertoires by exact and approximate sequence matching
por: Rognes, Torbjørn, et al.
Publicado: (2022) -
BNFinder: exact and efficient method for learning Bayesian networks
por: Wilczyński, Bartek, et al.
Publicado: (2009) -
SW#–GPU-enabled exact alignments on genome scale
por: Korpar, Matija, et al.
Publicado: (2013)