Efficient calculation of compound similarity based on maximum common subgraphs and its application to prediction of gene transcript levels

Properties of a chemical entity, both physical and biological, are related to its structure. Since compound similarity can be used to infer properties of novel compounds, in chemoinformatics much attention has been paid to ways of calculating structural similarity. A useful metric to capture the str...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of bioinformatics research and applications Ročník 9; číslo 4; s. 407
Hlavní autoři: Berlo, Rogier J P Van, Winterbach, Wynand, Groot, Marco J L De, Bender, Andreas, Verheijen, Peter J T, Reinders, Marcel J T, Ridder, Dick De
Médium: Journal Article
Jazyk:angličtina
Vydáno: Switzerland 2013
Témata:
ISSN:1744-5485
On-line přístup:Zjistit podrobnosti o přístupu
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Properties of a chemical entity, both physical and biological, are related to its structure. Since compound similarity can be used to infer properties of novel compounds, in chemoinformatics much attention has been paid to ways of calculating structural similarity. A useful metric to capture the structural similarity between compounds is the relative size of the Maximum Common Subgraph (MCS). The MCS is the largest substructure present in a pair of compounds, when represented as graphs. However, in practice it is difficult to employ such a metric, since calculation of the MCS becomes computationally intractable when it is large. We propose a novel algorithm that significantly reduces computation time for finding large MCSs, compared to a number of state-of-the-art approaches. The use of this algorithm is demonstrated in an application predicting the transcriptional response of breast cancer cell lines to different drug-like compounds, at a scale which is challenging for the most efficient MCS-algorithms to date. In this application 714 compounds were compared.
AbstractList Properties of a chemical entity, both physical and biological, are related to its structure. Since compound similarity can be used to infer properties of novel compounds, in chemoinformatics much attention has been paid to ways of calculating structural similarity. A useful metric to capture the structural similarity between compounds is the relative size of the Maximum Common Subgraph (MCS). The MCS is the largest substructure present in a pair of compounds, when represented as graphs. However, in practice it is difficult to employ such a metric, since calculation of the MCS becomes computationally intractable when it is large. We propose a novel algorithm that significantly reduces computation time for finding large MCSs, compared to a number of state-of-the-art approaches. The use of this algorithm is demonstrated in an application predicting the transcriptional response of breast cancer cell lines to different drug-like compounds, at a scale which is challenging for the most efficient MCS-algorithms to date. In this application 714 compounds were compared.
Properties of a chemical entity, both physical and biological, are related to its structure. Since compound similarity can be used to infer properties of novel compounds, in chemoinformatics much attention has been paid to ways of calculating structural similarity. A useful metric to capture the structural similarity between compounds is the relative size of the Maximum Common Subgraph (MCS). The MCS is the largest substructure present in a pair of compounds, when represented as graphs. However, in practice it is difficult to employ such a metric, since calculation of the MCS becomes computationally intractable when it is large. We propose a novel algorithm that significantly reduces computation time for finding large MCSs, compared to a number of state-of-the-art approaches. The use of this algorithm is demonstrated in an application predicting the transcriptional response of breast cancer cell lines to different drug-like compounds, at a scale which is challenging for the most efficient MCS-algorithms to date. In this application 714 compounds were compared.Properties of a chemical entity, both physical and biological, are related to its structure. Since compound similarity can be used to infer properties of novel compounds, in chemoinformatics much attention has been paid to ways of calculating structural similarity. A useful metric to capture the structural similarity between compounds is the relative size of the Maximum Common Subgraph (MCS). The MCS is the largest substructure present in a pair of compounds, when represented as graphs. However, in practice it is difficult to employ such a metric, since calculation of the MCS becomes computationally intractable when it is large. We propose a novel algorithm that significantly reduces computation time for finding large MCSs, compared to a number of state-of-the-art approaches. The use of this algorithm is demonstrated in an application predicting the transcriptional response of breast cancer cell lines to different drug-like compounds, at a scale which is challenging for the most efficient MCS-algorithms to date. In this application 714 compounds were compared.
Author Verheijen, Peter J T
Reinders, Marcel J T
Winterbach, Wynand
Bender, Andreas
Berlo, Rogier J P Van
Groot, Marco J L De
Ridder, Dick De
Author_xml – sequence: 1
  givenname: Rogier J P Van
  surname: Berlo
  fullname: Berlo, Rogier J P Van
  email: r.j.p.vanberlo@tudelft.nl
  organization: The Delft Bioinformatics Lab/Kluyver Centre for Genomics of Industrial Fermentation, Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Mekelweg 4, 2628 CD Delft, The Netherlands. r.j.p.vanberlo@tudelft.nl
– sequence: 2
  givenname: Wynand
  surname: Winterbach
  fullname: Winterbach, Wynand
– sequence: 3
  givenname: Marco J L De
  surname: Groot
  fullname: Groot, Marco J L De
– sequence: 4
  givenname: Andreas
  surname: Bender
  fullname: Bender, Andreas
– sequence: 5
  givenname: Peter J T
  surname: Verheijen
  fullname: Verheijen, Peter J T
– sequence: 6
  givenname: Marcel J T
  surname: Reinders
  fullname: Reinders, Marcel J T
– sequence: 7
  givenname: Dick De
  surname: Ridder
  fullname: Ridder, Dick De
BackLink https://www.ncbi.nlm.nih.gov/pubmed/23797997$$D View this record in MEDLINE/PubMed
BookMark eNo1kMtOwzAQRb0oog_4ADbISzYtsWM39rJUBYoqIaHuq4kzKUZ2EmIH0V_gq0nVdnU1mjNHmjsmg6qukJA7lsyYTMTj-u3pYzHjCUtniRRzpQZkxDIhplIoOSTjEL6SRMy5kNdkyNNMZ1pnI_K3KktrLFaRGnCmcxBtXdG6pKb2Td1VBQ3WWwetjQeaQ8CC9nsPv9Z3_gj5fgxdvm-h-QwU-gMb-2waZ81JFmvatFhYc1HvsUIaW6iCaW0TqcMfdOGGXJXgAt6ec0K2z6vt8nW6eX9ZLxebqUlTHaeKpzBXZcb6v2SCac6UAZlDaSDHHJUuoNBSGS045kdMlJqxUirkIoOET8jDSdu09XeHIe68DQadgwrrLuxYmvG5lpyJHr0_o13usdg1rfXQHnaX-vg_Atp2Mg
CitedBy_id crossref_primary_10_1007_s42979_020_00431_5
crossref_primary_10_1016_j_molstruc_2021_130980
crossref_primary_10_1109_TKDE_2019_2922956
crossref_primary_10_1038_s41598_017_11508_2
crossref_primary_10_1038_s41598_018_34692_1
crossref_primary_10_1007_s10115_015_0874_z
crossref_primary_10_1016_j_ymssp_2020_107144
crossref_primary_10_1007_s10115_015_0844_5
ContentType Journal Article
DBID CGR
CUY
CVF
ECM
EIF
NPM
7X8
DOI 10.1504/IJBRA.2013.054688
DatabaseName Medline
MEDLINE
MEDLINE (Ovid)
MEDLINE
MEDLINE
PubMed
MEDLINE - Academic
DatabaseTitle MEDLINE
Medline Complete
MEDLINE with Full Text
PubMed
MEDLINE (Ovid)
MEDLINE - Academic
DatabaseTitleList MEDLINE
MEDLINE - Academic
Database_xml – sequence: 1
  dbid: NPM
  name: PubMed
  url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed
  sourceTypes: Index Database
– sequence: 2
  dbid: 7X8
  name: MEDLINE - Academic
  url: https://search.proquest.com/medline
  sourceTypes: Aggregation Database
DeliveryMethod no_fulltext_linktorsrc
Discipline Biology
ExternalDocumentID 23797997
Genre Journal Article
GroupedDBID ---
0R~
29J
4.4
53G
5GY
ABJNI
ACGFS
ACIWK
ACPRK
AFRAH
ALMA_UNASSIGNED_HOLDINGS
ALSBL
CGR
CS3
CUY
CVF
DU5
EBS
ECM
EIF
EJD
F5P
H13
HZ~
MET
MIE
NPM
O9-
P2P
RTD
7X8
ID FETCH-LOGICAL-c339t-823a68f7148550e3b18ca5bafcabebe89dad958c942ebf7144f911f58e247a02
IEDL.DBID 7X8
ISSN 1744-5485
IngestDate Sun Nov 09 09:46:32 EST 2025
Thu Jan 02 23:01:15 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c339t-823a68f7148550e3b18ca5bafcabebe89dad958c942ebf7144f911f58e247a02
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
PMID 23797997
PQID 1372695214
PQPubID 23479
ParticipantIDs proquest_miscellaneous_1372695214
pubmed_primary_23797997
PublicationCentury 2000
PublicationDate 2013-00-00
20130101
PublicationDateYYYYMMDD 2013-01-01
PublicationDate_xml – year: 2013
  text: 2013-00-00
PublicationDecade 2010
PublicationPlace Switzerland
PublicationPlace_xml – name: Switzerland
PublicationTitle International journal of bioinformatics research and applications
PublicationTitleAlternate Int J Bioinform Res Appl
PublicationYear 2013
SSID ssj0046245
Score 1.9680773
Snippet Properties of a chemical entity, both physical and biological, are related to its structure. Since compound similarity can be used to infer properties of novel...
SourceID proquest
pubmed
SourceType Aggregation Database
Index Database
StartPage 407
SubjectTerms Algorithms
Databases, Factual
Drug Design
Models, Molecular
Pharmaceutical Preparations - chemistry
Transcription, Genetic
Title Efficient calculation of compound similarity based on maximum common subgraphs and its application to prediction of gene transcript levels
URI https://www.ncbi.nlm.nih.gov/pubmed/23797997
https://www.proquest.com/docview/1372695214
Volume 9
hasFullText
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3JTsMwELWAgsSFfV9kJK6B1nZq54QAUQESFUI99FY5XqRIpClNiuAX-Gpm3JReOCBxSQ6xE8uezDz7jeYRcs48R7E6HoEL1JEAABtpFWN5PCtMk1ltlA9iE7LbVf1-8lwfuJV1WuXMJwZHbQuDZ-SXLS5ZO4FgI65GbxGqRiG7WktoLJIGByiDVi37PyyCaLMgUgygW0SAzOOa1Yyb4vLh8eblGjO7-AWAlpnwyq8IM0Sazvp_x7hB1mqMSa-nRrFJFtxwi6xMVSc_t8nXXSgbAdGGwgKZWr-LFp5ifjnKLNEyyzPY8gJCpxjmLIXnuf7I8kmOjeA7tJykodh1STV0yCq4z7lwWhV0NEYOaPZqsFNHKwyMwU3RV0xWKndIr3PXu72PakmGyHCeVJFiXLeVl61QCM3xtKWMjlPtjU7BHFRitU1iZRLBXIrNhAdv6mPlmJC6yXbJ0rAYun1CbZzCTkn61AGIMcwqm4rEyjYEVet0q3lAzmZzPACLRxpDD10xKQfzWT4ge9OFGoympTkGjEvkKeXhH3ofkVUWtC3wPOWYNDz87-6ELJv3KivHp8GU4Np9fvoG683WSw
linkProvider ProQuest
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+calculation+of+compound+similarity+based+on+maximum+common+subgraphs+and+its+application+to+prediction+of+gene+transcript+levels&rft.jtitle=International+journal+of+bioinformatics+research+and+applications&rft.au=Berlo%2C+Rogier+J+P+Van&rft.au=Winterbach%2C+Wynand&rft.au=Groot%2C+Marco+J+L+De&rft.au=Bender%2C+Andreas&rft.date=2013-01-01&rft.issn=1744-5485&rft.volume=9&rft.issue=4&rft.spage=407&rft_id=info:doi/10.1504%2FIJBRA.2013.054688&rft_id=info%3Apmid%2F23797997&rft_id=info%3Apmid%2F23797997&rft.externalDocID=23797997
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1744-5485&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1744-5485&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1744-5485&client=summon