Skip to content
Snippets Groups Projects
  1. Mar 20, 2024
  2. Mar 15, 2024
  3. Mar 08, 2024
  4. Mar 06, 2024
    • Studer Gabriel's avatar
      chain mapping: modest refactor · fb1f53f2
      Studer Gabriel authored
      Introduce GetRMSDMapping function which replaces GetRigidMapping
      
      This is consistent with the other mapping functions that explicitely
      contain score name in the function name: GetQSScoreMapping/GetlDDTMapping
      
      Any GDT functionality has been dropped in the process. It never took off
      and scoring is problematic anyways. Let's assume there is a huge complex
      and you already mapped most of it. Now there is this chain which upon
      superposition is 10A away and this other chain that is 1000A away.
      GDT does not resolve this. They're both 0.0.
      fb1f53f2
    • Studer Gabriel's avatar
    • Studer Gabriel's avatar
      lddt: docu update · 2f212812
      Studer Gabriel authored
      2f212812
  5. Mar 01, 2024
  6. Feb 29, 2024
  7. Feb 28, 2024
  8. Feb 20, 2024
  9. Feb 19, 2024
  10. Feb 16, 2024
    • Xavier Robin's avatar
      fix: support for Python < 3.10 · 5d38b950
      Xavier Robin authored
      Verified
      5d38b950
    • Studer Gabriel's avatar
      make removing atoms fast again · f04f0859
      Studer Gabriel authored
      Removing atoms from huge structures was observed to be super slow.
      Reason was the removal from the spatial organizer which helps to find atoms
      based on spatial proximity. The organizer is organized in buckets which
      occupy a certain volume in space. Removing an element meant to iterate over
      all buckets and all their items until the atom is found. However, we know
      the position of the atom and thus can pinpoint the bucket in which its
      expected to be. The SpatialOrganizer::Remove was therefore overloaded with
      a version that accepts a position as hint in which bucket to look.
      If the atom is there, delete and return. If not, call Remove without position
      hint.
      f04f0859
  11. Feb 15, 2024
    • Studer Gabriel's avatar
      lddt: speedup for big complexes · aaec9ede
      Studer Gabriel authored
      Pairwise distance computation for the reference distances was
      performed with N squared complexity and some funny guy had the idea
      to throw a 180mer at it...
      
      One possibibility would be the use of some KD tree data structure.
      However, the construction itself comes with computational cost.
      The implemented solution makes use of the expected spatial proximity
      of atoms in the same chain and distances are computed as follows:
      
      - process each chain individually
      - perform crude collision detection
      - process potentially interacting chain pairs
      - concatenate distances from all processing steps
      
      The new algorithm has been tested and compared to the previous
      implementation by randomly selecting 3 models of each CASP15 oligo
      target. Global lDDT has been tested for a match within 0.0001 and
      per-residue lDDT for a match within 0.001. Reason for lower threshold
      in per-residue lDDT is floating point accuracy. Also for the changed
      unit test, one distance difference was within floating point accuracy
      of one of the thresholds (see comments there). Accuracy of 0.001 still
      means that we only allow a discrepancy of one for 1000 checked distances...
      
      Observed speedups are size dependent and range from lower 2 digit
      percentages up to several fold speedup for larger CASP15 targets.
      The mentioned 180mer now concludes in a few minutes as oposed to
      almost a day.
      aaec9ede
    • Studer Gabriel's avatar
      0356d1b9
    • Studer Gabriel's avatar
      compare-structures: docu update · 6977d26f
      Studer Gabriel authored
      Document default values for minimum peptide/nucleotide lengths
      6977d26f
  12. Feb 14, 2024
  13. Feb 13, 2024
  14. Feb 12, 2024
  15. Feb 07, 2024
Loading