3
Candidates
{"N": 8}
Ground Truth
{"N": 4}
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.20 ± 0.00
c1cc2ccc3ccc[n]4->[Ru+2]<-[n](c1)c2c34
#1
TOP-1
0.20 ± 0.00
c1cc2ccc3ccc[n]4->[Ru+2]<-[n](c1)c2c34
#1
TOP-1
0.20 ± 0.00
c1cc2ccc3ccc[n]4->[Ru+2]<-[n](c1)c2c34
#1
TOP-1
0.20 ± 0.00
c1cc2ccc3ccc[n]4->[Ru+2]<-[n](c1)c2c34
#1
TOP-1
0.20 ± 0.00
c1cc2ccc3ccc[n]4->[Ru+2]<-[n](c1)c2c34
#1
TOP-1
0.20 ± 0.00
c1cc2ccc3ccc[n]4->[Ru+2]<-[n](c1)c2c34
#1
TOP-1
0.20 ± 0.00
c1cc2ccc3ccc[n]4->[Ru+2]<-[n](c1)c2c34
#1
TOP-1
0.20 ± 0.00
c1cc2ccc3ccc[n]4->[Ru+2]<-[n](c1)c2c34
#1
TOP-1
0.20 ± 0.00
c1cc2ccc3ccc[n]4->[Ru+2]<-[n](c1)c2c34
#2
0.01 ± 0.00
Sc1[nH]c(-c2cccnc2)n[n]1->[Ru+2]
#2
0.01 ± 0.00
Sc1[nH]c(-c2cccnc2)n[n]1->[Ru+2]
#2
0.01 ± 0.00
Sc1[nH]c(-c2cccnc2)n[n]1->[Ru+2]
#2
0.01 ± 0.00
Sc1[nH]c(-c2cccnc2)n[n]1->[Ru+2]
#2
0.01 ± 0.00
Sc1[nH]c(-c2cccnc2)n[n]1->[Ru+2]
#2
0.01 ± 0.00
Sc1[nH]c(-c2cccnc2)n[n]1->[Ru+2]
#2
0.01 ± 0.00
Sc1[nH]c(-c2cccnc2)n[n]1->[Ru+2]
#2
0.01 ± 0.00
Sc1[nH]c(-c2cccnc2)n[n]1->[Ru+2]
#2
0.01 ± 0.00
Sc1[nH]c(-c2cccnc2)n[n]1->[Ru+2]
#3
0.00 ± 0.00
Sc1[nH]c2-c3ccc[n](->[Ru+2]<-[n]1n2)c3
#3
0.00 ± 0.00
Sc1[nH]c2-c3ccc[n](->[Ru+2]<-[n]1n2)c3
#3
0.00 ± 0.00
Sc1[nH]c2-c3ccc[n](->[Ru+2]<-[n]1n2)c3
#3
0.00 ± 0.00
Sc1[nH]c2-c3ccc[n](->[Ru+2]<-[n]1n2)c3
#3
0.00 ± 0.00
Sc1[nH]c2-c3ccc[n](->[Ru+2]<-[n]1n2)c3
#3
0.00 ± 0.00
Sc1[nH]c2-c3ccc[n](->[Ru+2]<-[n]1n2)c3
#3
0.00 ± 0.00
Sc1[nH]c2-c3ccc[n](->[Ru+2]<-[n]1n2)c3
#3
0.00 ± 0.00
Sc1[nH]c2-c3ccc[n](->[Ru+2]<-[n]1n2)c3
#3
0.00 ± 0.00
Sc1[nH]c2-c3ccc[n](->[Ru+2]<-[n]1n2)c3
#4
0.00 ± 0.00
Sc1[nH]c(-c2cccnc2)[n]2->[Ru+2]<-[n]12
#4
0.00 ± 0.00
Sc1[nH]c(-c2cccnc2)[n]2->[Ru+2]<-[n]12
#4
0.00 ± 0.00
Sc1[nH]c(-c2cccnc2)[n]2->[Ru+2]<-[n]12