Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.
Lära Challenge: Filter a Compound Library | Virtual Screening and Compound Ranking
Practice
Projects
Quizzes & Challenges
Quizzes
Challenges
/
Python for Chemoinformatics

bookChallenge: Filter a Compound Library

Uppgift

Swipe to start coding

Your task is to implement a function that filters a list of SMILES strings, returning only those that pass Lipinski's Rule of Five. Use RDKit to calculate molecular properties.

  • Define a function filter_druglike_smiles(smiles_list) that takes a list of SMILES strings.
  • For each valid molecule, check the following criteria:
    • Molecular weight is less than or equal to 500 daltons.
    • LogP (octanol-water partition coefficient) is less than or equal to 5.
    • No more than 5 hydrogen bond donors.
    • No more than 10 hydrogen bond acceptors.
  • Ignore any SMILES strings that cannot be parsed by RDKit.
  • Return a list of SMILES strings that pass all the rules.

Lösning

Var allt tydligt?

Hur kan vi förbättra det?

Tack för dina kommentarer!

Avsnitt 3. Kapitel 2
single

single

Fråga AI

expand

Fråga AI

ChatGPT

Fråga vad du vill eller prova någon av de föreslagna frågorna för att starta vårt samtal

close

bookChallenge: Filter a Compound Library

Svep för att visa menyn

Uppgift

Swipe to start coding

Your task is to implement a function that filters a list of SMILES strings, returning only those that pass Lipinski's Rule of Five. Use RDKit to calculate molecular properties.

  • Define a function filter_druglike_smiles(smiles_list) that takes a list of SMILES strings.
  • For each valid molecule, check the following criteria:
    • Molecular weight is less than or equal to 500 daltons.
    • LogP (octanol-water partition coefficient) is less than or equal to 5.
    • No more than 5 hydrogen bond donors.
    • No more than 10 hydrogen bond acceptors.
  • Ignore any SMILES strings that cannot be parsed by RDKit.
  • Return a list of SMILES strings that pass all the rules.

Lösning

Switch to desktopByt till skrivbordet för praktisk övningFortsätt där du är med ett av alternativen nedan
Var allt tydligt?

Hur kan vi förbättra det?

Tack för dina kommentarer!

Avsnitt 3. Kapitel 2
single

single

some-alt