Making the most of approximate maximum common substructure search.
scientific article published on 11 March 2014
Press Enter · cited answer in seconds
0 sources
Summary
Making the most of approximate maximum common substructure search. is a scholarly conference abstract[1].
Key Facts
- Making the most of approximate maximum common substructure search.'s instance of is recorded as scholarly conference abstract[2].
- Making the most of approximate maximum common substructure search.'s copyright license is recorded as Creative Commons Attribution 4.0 International[3].
- Making the most of approximate maximum common substructure search.'s page is recorded as P29-P29[4].
- Making the most of approximate maximum common substructure search.'s DOI is recorded as 10.1186/1758-2946-6-S1-P29[5].
- Making the most of approximate maximum common substructure search.'s issue is recorded as Suppl 1[6].
- Making the most of approximate maximum common substructure search.'s volume is recorded as 6[7].
- Making the most of approximate maximum common substructure search.'s publication date is recorded as +2014-03-11T00:00:00Z[8].
- Making the most of approximate maximum common substructure search.'s main subject is recorded as maximum common substructure[9].
- Making the most of approximate maximum common substructure search.'s PMC publication ID is recorded as 3980124[10].
- Making the most of approximate maximum common substructure search.'s published in is recorded as Journal of Cheminformatics[11].
- Making the most of approximate maximum common substructure search.'s title is recorded as Making the most of approximate maximum common substructure search.[12].
- Making the most of approximate maximum common substructure search.'s author name string is recorded as Péter Englert[13].
- Making the most of approximate maximum common substructure search.'s author name string is recorded as Péter Kovács[14].
- Making the most of approximate maximum common substructure search.'s cites work is recorded as Build-Up Algorithm for Atomic Correspondence between Chemical Structures[15].
- Making the most of approximate maximum common substructure search.'s cites work is recorded as Maximum common subgraph isomorphism algorithms for the matching of chemical structures[16].
- Making the most of approximate maximum common substructure search.'s Dimensions publication ID is recorded as 1018543185[17].
- Making the most of approximate maximum common substructure search.'s copyright status is recorded as copyrighted[18].
- Making the most of approximate maximum common substructure search.'s DBLP publication ID is recorded as journals/jcheminf/EnglertK14[19].
Body
Designation and Status
Making the most of approximate maximum common substructure search.'s instance of is recorded as scholarly conference abstract[2].