2
Candidates
{"O": 1, "N": 2}
Ground Truth
{"N": 2, "O": 2}
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.05 ± 0.00
Brc1ccc(/C(=N/N=C\c2cccs2)[O][Ru+])cc1
#1
TOP-1
0.05 ± 0.00
Brc1ccc(/C(=N/N=C\c2cccs2)[O][Ru+])cc1
#1
TOP-1
0.05 ± 0.00
Brc1ccc(/C(=N/N=C\c2cccs2)[O][Ru+])cc1
#1
TOP-1
0.05 ± 0.00
Brc1ccc(/C(=N/N=C\c2cccs2)[O][Ru+])cc1
#1
TOP-1
0.05 ± 0.00
Brc1ccc(/C(=N/N=C\c2cccs2)[O][Ru+])cc1
#1
TOP-1
0.05 ± 0.00
Brc1ccc(/C(=N/N=C\c2cccs2)[O][Ru+])cc1
#1
TOP-1
0.05 ± 0.00
Brc1ccc(/C(=N/N=C\c2cccs2)[O][Ru+])cc1
#1
TOP-1
0.05 ± 0.00
Brc1ccc(/C(=N/N=C\c2cccs2)[O][Ru+])cc1
#1
TOP-1
0.05 ± 0.00
Brc1ccc(/C(=N/N=C\c2cccs2)[O][Ru+])cc1
#1
TOP-1
0.95 ± 0.11
Brc1ccc(C2=N/[N](=C\c3cccs3)->[Ru+][O]2)cc1
#2
0.02 ± 0.00
C1=C[CH]2[Ru+2][CH]2C=C1
#2
0.02 ± 0.00
C1=C[CH]2[Ru+2][CH]2C=C1
#2
0.02 ± 0.00
C1=C[CH]2[Ru+2][CH]2C=C1
#2
0.02 ± 0.00
C1=C[CH]2[Ru+2][CH]2C=C1
#2
0.02 ± 0.00
C1=C[CH]2[Ru+2][CH]2C=C1
#2
0.02 ± 0.00
C1=C[CH]2[Ru+2][CH]2C=C1
#2
0.02 ± 0.00
C1=C[CH]2[Ru+2][CH]2C=C1
#2
0.02 ± 0.00
C1=C[CH]2[Ru+2][CH]2C=C1
#2
0.02 ± 0.00
C1=C[CH]2[Ru+2][CH]2C=C1
#2
0.06 ± 0.12
Brc1ccc(/C(=N/N=C\c2cccs2)[O][Ru+])cc1
#3
0.01 ± 0.00
Brc1ccc(C2=N[N]3=Cc4ccc[s]4->[Ru+]<-3[O]2)cc1
#3
0.01 ± 0.00
Brc1ccc(C2=N[N]3=Cc4ccc[s]4->[Ru+]<-3[O]2)cc1
#3
0.01 ± 0.00
Brc1ccc(C2=N[N]3=Cc4ccc[s]4->[Ru+]<-3[O]2)cc1
#3
0.01 ± 0.00
Brc1ccc(C2=N[N]3=Cc4ccc[s]4->[Ru+]<-3[O]2)cc1
#3
0.01 ± 0.00
Brc1ccc(C2=N[N]3=Cc4ccc[s]4->[Ru+]<-3[O]2)cc1
#3
0.01 ± 0.00
Brc1ccc(C2=N[N]3=Cc4ccc[s]4->[Ru+]<-3[O]2)cc1
#3
0.01 ± 0.00
Brc1ccc(C2=N[N]3=Cc4ccc[s]4->[Ru+]<-3[O]2)cc1
#3
0.01 ± 0.00
Brc1ccc(C2=N[N]3=Cc4ccc[s]4->[Ru+]<-3[O]2)cc1
#3
0.01 ± 0.00
Brc1ccc(C2=N[N]3=Cc4ccc[s]4->[Ru+]<-3[O]2)cc1
#3
0.01 ± 0.01
Brc1ccc(C2=N[N]3=Cc4ccc[s]4->[Ru+]<-3[O]2)cc1