Home › Entities › scholarly_conference_abstract › FMCS: a novel algorithm for the multiple MCS problem

FMCS: a novel algorithm for the multiple MCS problem

scientific article (publication date: 2013)
Place scholarly_conference_abstract Q27885304
Press Enter · cited answer in seconds

FMCS: a novel algorithm for the multiple MCS problem

Summary

FMCS: a novel algorithm for the multiple MCS problem is a scholarly conference abstract[1].

Key Facts

  • FMCS: a novel algorithm for the multiple MCS problem authored a novel algorithm for the multiple MCS problem — author (P50): Janna Hastings[2].
  • FMCS: a novel algorithm for the multiple MCS problem authored a novel algorithm for the multiple MCS problem — author (P50): Andrew Dalke[3].
  • FMCS: a novel algorithm for the multiple MCS problem's instance of is recorded as a novel algorithm for the multiple MCS problem — instance of (P31): scholarly conference abstract[4].
  • FMCS: a novel algorithm for the multiple MCS problem's copyright license is recorded as a novel algorithm for the multiple MCS problem — copyright license (P275): Creative Commons Attribution 2.0 Generic[5].
  • FMCS: a novel algorithm for the multiple MCS problem's page is recorded as O6[6].
  • FMCS: a novel algorithm for the multiple MCS problem's DOI is recorded as 10.1186/1758-2946-5-S1-O6[7].
  • FMCS: a novel algorithm for the multiple MCS problem's issue is recorded as Suppl 1[8].
  • FMCS: a novel algorithm for the multiple MCS problem's volume is recorded as 5[9].
  • FMCS: a novel algorithm for the multiple MCS problem's publication date is recorded as +2013-00-00T00:00:00Z[10].
  • FMCS: a novel algorithm for the multiple MCS problem's PMC publication ID is recorded as 3606201[11].
  • FMCS: a novel algorithm for the multiple MCS problem's published in is recorded as a novel algorithm for the multiple MCS problem — published in (P1433): Journal of Cheminformatics[12].
  • FMCS: a novel algorithm for the multiple MCS problem's title is recorded as FMCS: a novel algorithm for the multiple MCS problem[13].
  • FMCS: a novel algorithm for the multiple MCS problem's cites work is recorded as a novel algorithm for the multiple MCS problem — cites work (P2860): Small Molecule Subgraph Detector (SMSD) toolkit[14].
  • FMCS: a novel algorithm for the multiple MCS problem's cites work is recorded as a novel algorithm for the multiple MCS problem — cites work (P2860): ChEBI: a database and ontology for chemical entities of biological interest[15].
  • FMCS: a novel algorithm for the multiple MCS problem's cites work is recorded as a novel algorithm for the multiple MCS problem — cites work (P2860): Maximum common subgraph isomorphism algorithms for the matching of chemical structures[16].
  • FMCS: a novel algorithm for the multiple MCS problem's cites work is recorded as a novel algorithm for the multiple MCS problem — cites work (P2860): MultiMCS: a fast algorithm for the maximum common substructure problem on multiple molecules[17].
  • FMCS: a novel algorithm for the multiple MCS problem's Dimensions publication ID is recorded as 1004991041[18].
  • FMCS: a novel algorithm for the multiple MCS problem's copyright status is recorded as a novel algorithm for the multiple MCS problem — copyright status (P6216): copyrighted[19].
  • FMCS: a novel algorithm for the multiple MCS problem's DBLP publication ID is recorded as journals/jcheminf/DalkeH13[20].

Body

Designation and Status

FMCS: a novel algorithm for the multiple MCS problem's instance of is recorded as a novel algorithm for the multiple MCS problem — instance of (P31): scholarly conference abstract[4].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [4] ↑ . wikidata.org.
  2. [2] ↑ . wikidata.org.
  3. [3] ↑ . wikidata.org.
  4. [5] ↑ . April 2022 Public Data File from Crossref. wikidata.org.
  5. [6] ↑ . wikidata.org.
  6. [7] ↑ . wikidata.org.
  7. [8] ↑ . wikidata.org.
  8. [9] ↑ . wikidata.org.
  9. [10] ↑ . wikidata.org.
  10. [11] ↑ . wikidata.org.
  11. [12] ↑ . Q5188229. wikidata.org.
  12. [13] ↑ . wikidata.org.
  13. [14] ↑ . Q229883. Retrieved . eutils.ncbi.nlm.nih.gov. Provenance: wikidata.org.
  14. [15] ↑ . Q229883. Retrieved . eutils.ncbi.nlm.nih.gov. Provenance: wikidata.org.
  15. [16] ↑ . Q229883. Retrieved . eutils.ncbi.nlm.nih.gov. Provenance: wikidata.org.
  16. [17] ↑ . Q229883. Retrieved . eutils.ncbi.nlm.nih.gov. Provenance: wikidata.org.
  17. [18] ↑ . SciGraph. Retrieved . scigraph.springernature.com. Provenance: wikidata.org.
  18. [19] ↑ . wikidata.org.
  19. [20] ↑ . DBLP Dataset 2021-01-02. Retrieved . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). FMCS: a novel algorithm for the multiple MCS problem. Retrieved May 3, 2026, from https://4ort.xyz/entity/fmcs-a-novel-algorithm-for-the-multiple-mcs-problem
MLA “FMCS: a novel algorithm for the multiple MCS problem.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/fmcs-a-novel-algorithm-for-the-multiple-mcs-problem.
BibTeX @misc{4ortxyz_fmcs-a-novel-algorithm-for-the-multiple-mcs-problem_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{FMCS: a novel algorithm for the multiple MCS problem}}, year = {2026}, url = {https://4ort.xyz/entity/fmcs-a-novel-algorithm-for-the-multiple-mcs-problem}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): FMCS: a novel algorithm for the multiple MCS problem — https://4ort.xyz/entity/fmcs-a-novel-algorithm-for-the-multiple-mcs-problem (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/fmcs-a-novel-algorithm-for-the-multiple-mcs-problem · Last refreshed: