Efficient maximum common subgraph (MCS) searching of large chemical databases.
scientific article
Press Enter · cited answer in seconds
0 sources
Summary
Efficient maximum common subgraph (MCS) searching of large chemical databases. is a scholarly conference abstract[1].
Key Facts
- Efficient maximum common subgraph (MCS) searching of large chemical databases. authored Roger Sayle[2].
- Efficient maximum common subgraph (MCS) searching of large chemical databases.'s instance of is recorded as scholarly conference abstract[3].
- Efficient maximum common subgraph (MCS) searching of large chemical databases.'s copyright license is recorded as Creative Commons Attribution 2.0 Generic[4].
- Efficient maximum common subgraph (MCS) searching of large chemical databases.'s page is recorded as O15-O15[5].
- Efficient maximum common subgraph (MCS) searching of large chemical databases.'s DOI is recorded as 10.1186/1758-2946-5-S1-O15[6].
- Efficient maximum common subgraph (MCS) searching of large chemical databases.'s issue is recorded as Suppl 1[7].
- Efficient maximum common subgraph (MCS) searching of large chemical databases.'s volume is recorded as 5[8].
- Efficient maximum common subgraph (MCS) searching of large chemical databases.'s publication date is recorded as +2013-03-22T00:00:00Z[9].
- Efficient maximum common subgraph (MCS) searching of large chemical databases.'s main subject is recorded as maximum common subgraph[10].
- Efficient maximum common subgraph (MCS) searching of large chemical databases.'s PMC publication ID is recorded as 3606195[11].
- Efficient maximum common subgraph (MCS) searching of large chemical databases.'s published in is recorded as Journal of Cheminformatics[12].
- Efficient maximum common subgraph (MCS) searching of large chemical databases.'s title is recorded as Efficient maximum common subgraph (MCS) searching of large chemical databases.[13].
- Efficient maximum common subgraph (MCS) searching of large chemical databases.'s author name string is recorded as Jose Batista[14].
- Efficient maximum common subgraph (MCS) searching of large chemical databases.'s author name string is recorded as J Andrew Grant[15].
- Efficient maximum common subgraph (MCS) searching of large chemical databases.'s cites work is recorded as Rapid subgraph search using parallelism[16].
- Efficient maximum common subgraph (MCS) searching of large chemical databases.'s Dimensions publication ID is recorded as 1018654633[17].
- Efficient maximum common subgraph (MCS) searching of large chemical databases.'s copyright status is recorded as copyrighted[18].
- Efficient maximum common subgraph (MCS) searching of large chemical databases.'s DBLP publication ID is recorded as journals/jcheminf/SayleBG13[19].
Body
Designation and Status
Efficient maximum common subgraph (MCS) searching of large chemical databases.'s instance of is recorded as scholarly conference abstract[3].