Cargando…
FAMCS: Finding All Maximal Common Substructures in Proteins
Finding the common substructures shared by two proteins is considered as one of the central issues in computational biology because of its usefulness in understanding the structure-function relationship and application in drug and vaccine design. In this paper, we propose a novel algorithm called FA...
Autores principales: | Yao, Zhen, Xiao, Juan, Tung, Anthony K.H., Sung, Wing Kin |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier
2005
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5172543/ https://www.ncbi.nlm.nih.gov/pubmed/16393147 http://dx.doi.org/10.1016/S1672-0229(05)03015-9 |
Ejemplares similares
-
Ligand scaffold hopping combining 3D maximal substructure search and molecular similarity
por: Quintus, Flavien, et al.
Publicado: (2009) -
Finding all maximal perfect haplotype blocks in linear time
por: Alanko, Jarno, et al.
Publicado: (2020) -
Making the most of approximate maximum common substructure search
por: Englert, Péter, et al.
Publicado: (2014) -
Introducing fuzziness into maximum common substructures for meaningful cluster characterisation
por: Herhaus, Christian
Publicado: (2014) -
Single-step retrosynthesis prediction by leveraging commonly preserved substructures
por: Fang, Lei, et al.
Publicado: (2023)