Cargando…
Efficient algorithms for Longest Common Subsequence of two bucket orders to speed up pairwise genetic map comparison
Genetic maps order genetic markers along chromosomes. They are, for instance, extensively used in marker-assisted selection to accelerate breeding programs. Even for the same species, people often have to deal with several alternative maps obtained using different ordering methods or different datas...
Autores principales: | De Mattéo, Lisa, Holtz, Yan, Ranwez, Vincent, Bérard, Sèverine |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6320017/ https://www.ncbi.nlm.nih.gov/pubmed/30589848 http://dx.doi.org/10.1371/journal.pone.0208838 |
Ejemplares similares
-
Acceleration of sequence clustering using longest common subsequence filtering
por: Namiki, Youhei, et al.
Publicado: (2013) -
Automatic ICD-10 coding algorithm using an improved longest common subsequence based on semantic similarity
por: Chen, YunZhi, et al.
Publicado: (2017) -
A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS) Problem
por: Peng, Zhan, et al.
Publicado: (2017) -
An OpenMP-based tool for finding longest common subsequence in bioinformatics
por: Shikder, Rayhan, et al.
Publicado: (2019) -
Speeding up tandem mass spectrometry-based database searching by longest common prefix
por: Zhou, Chen, et al.
Publicado: (2010)