Cargando…
Algorithms for matching partially labelled sequence graphs
BACKGROUND: In order to find correlated pairs of positions between proteins, which are useful in predicting interactions, it is necessary to concatenate two large multiple sequence alignments such that the sequences that are joined together belong to those that interact in their species of origin. W...
Autor principal: | Taylor, William R. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5613400/ https://www.ncbi.nlm.nih.gov/pubmed/29021818 http://dx.doi.org/10.1186/s13015-017-0115-y |
Ejemplares similares
-
Population-wise labeling of sulcal graphs using multi-graph matching
por: Yadav, Rohit, et al.
Publicado: (2023) -
Heuristic algorithms for best match graph editing
por: Schaller, David, et al.
Publicado: (2021) -
Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs
por: Mkrtchyan, Vahan, et al.
Publicado: (2020) -
The LabelHash algorithm for substructure matching
por: Moll, Mark, et al.
Publicado: (2010) -
Graphs, algorithms, and optimization
por: Kocay, William L.
Publicado: (2017)