3
Candidates
{"S": 2, "N": 1}
Ground Truth
{"S": 5}
Top-1 Prediction
0.000
Match Score
⚠ Per-candidate scores unavailable for sequential. Showing 30 candidates from single-ligand scoring.
For sequential results only top-1 prediction is stored.
#1
TOP-1
0.52 ± 0.00
CC(=O)[S][Ru+]
#1
TOP-1
0.52 ± 0.00
CC(=O)[S][Ru+]
#1
TOP-1
0.52 ± 0.00
CC(=O)[S][Ru+]
#1
TOP-1
0.52 ± 0.00
CC(=O)[S][Ru+]
#1
TOP-1
0.52 ± 0.00
CC(=O)[S][Ru+]
#1
TOP-1
0.52 ± 0.00
CC(=O)[S][Ru+]
#1
TOP-1
0.52 ± 0.00
CC(=O)[S][Ru+]
#1
TOP-1
0.52 ± 0.00
CC(=O)[S][Ru+]
#1
TOP-1
0.52 ± 0.00
CC(=O)[S][Ru+]
#2
0.44 ± 0.00
S=C([S][Ru+])c1n(C2CCCCC2)cc[n+]1C1CCCCC1
#2
0.44 ± 0.00
S=C([S][Ru+])c1n(C2CCCCC2)cc[n+]1C1CCCCC1
#2
0.44 ± 0.00
S=C([S][Ru+])c1n(C2CCCCC2)cc[n+]1C1CCCCC1
#2
0.44 ± 0.00
S=C([S][Ru+])c1n(C2CCCCC2)cc[n+]1C1CCCCC1
#2
0.44 ± 0.00
S=C([S][Ru+])c1n(C2CCCCC2)cc[n+]1C1CCCCC1
#2
0.44 ± 0.00
S=C([S][Ru+])c1n(C2CCCCC2)cc[n+]1C1CCCCC1
#2
0.44 ± 0.00
S=C([S][Ru+])c1n(C2CCCCC2)cc[n+]1C1CCCCC1
#2
0.44 ± 0.00
S=C([S][Ru+])c1n(C2CCCCC2)cc[n+]1C1CCCCC1
#2
0.44 ± 0.00
S=C([S][Ru+])c1n(C2CCCCC2)cc[n+]1C1CCCCC1
#3
0.41 ± 0.00
CC(=O)[S][Ru][S]C(=S)c1n(C2CCCCC2)cc[n+]1C1CCCCC1
#3
0.41 ± 0.00
CC(=O)[S][Ru][S]C(=S)c1n(C2CCCCC2)cc[n+]1C1CCCCC1
#3
0.41 ± 0.00
CC(=O)[S][Ru][S]C(=S)c1n(C2CCCCC2)cc[n+]1C1CCCCC1
#3
0.41 ± 0.00
CC(=O)[S][Ru][S]C(=S)c1n(C2CCCCC2)cc[n+]1C1CCCCC1
#3
0.41 ± 0.00
CC(=O)[S][Ru][S]C(=S)c1n(C2CCCCC2)cc[n+]1C1CCCCC1
#3
0.41 ± 0.00
CC(=O)[S][Ru][S]C(=S)c1n(C2CCCCC2)cc[n+]1C1CCCCC1
#3
0.41 ± 0.00
CC(=O)[S][Ru][S]C(=S)c1n(C2CCCCC2)cc[n+]1C1CCCCC1
#3
0.41 ± 0.00
CC(=O)[S][Ru][S]C(=S)c1n(C2CCCCC2)cc[n+]1C1CCCCC1
#3
0.41 ± 0.00
CC(=O)[S][Ru][S]C(=S)c1n(C2CCCCC2)cc[n+]1C1CCCCC1
#4
0.40 ± 0.00
c1c[n+](C2CCCCC2)c(C2[S][Ru+]<-[S]=2)n1C1CCCCC1
#4
0.40 ± 0.00
c1c[n+](C2CCCCC2)c(C2[S][Ru+]<-[S]=2)n1C1CCCCC1
#4
0.40 ± 0.00
c1c[n+](C2CCCCC2)c(C2[S][Ru+]<-[S]=2)n1C1CCCCC1