Cargando…
Making the most of approximate maximum common substructure search
Autores principales: | Englert, Péter, Kovács, Péter |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3980124/ http://dx.doi.org/10.1186/1758-2946-6-S1-P29 |
Ejemplares similares
-
Introducing fuzziness into maximum common substructures for meaningful cluster characterisation
por: Herhaus, Christian
Publicado: (2014) -
Searching substructures in fragment spaces
por: Ehrlich, H-C, et al.
Publicado: (2011) -
A maximum common substructure-based algorithm for searching and predicting drug-like compounds
por: Cao, Yiqun, et al.
Publicado: (2008) -
Get the best from substructure mining
por: Kazius, Jeroen
Publicado: (2010) -
Design of chemical libraries with potentially bioactive molecules applying a maximum common substructure concept
por: Lisurek, Michael, et al.
Publicado: (2009)