2
Candidates
{"N": 8}
Ground Truth
{"N": 6}
Top-1 Prediction
0.750
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.06 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc(-c4ccccn4)[n]4->[Ru+2]56(<-[n]7ccccc7-c4c3)<-[n]3ccccc3-c3cc(-c4ccc(...
#1
TOP-1
0.06 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc(-c4ccccn4)[n]4->[Ru+2]56(<-[n]7ccccc7-c4c3)<-[n]3ccccc3-c3cc(-c4ccc(...
#1
TOP-1
0.06 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc(-c4ccccn4)[n]4->[Ru+2]56(<-[n]7ccccc7-c4c3)<-[n]3ccccc3-c3cc(-c4ccc(...
#1
TOP-1
0.06 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc(-c4ccccn4)[n]4->[Ru+2]56(<-[n]7ccccc7-c4c3)<-[n]3ccccc3-c3cc(-c4ccc(...
#1
TOP-1
0.06 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc(-c4ccccn4)[n]4->[Ru+2]56(<-[n]7ccccc7-c4c3)<-[n]3ccccc3-c3cc(-c4ccc(...
#1
TOP-1
0.06 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc(-c4ccccn4)[n]4->[Ru+2]56(<-[n]7ccccc7-c4c3)<-[n]3ccccc3-c3cc(-c4ccc(...
#1
TOP-1
0.06 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc(-c4ccccn4)[n]4->[Ru+2]56(<-[n]7ccccc7-c4c3)<-[n]3ccccc3-c3cc(-c4ccc(...
#1
TOP-1
0.06 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc(-c4ccccn4)[n]4->[Ru+2]56(<-[n]7ccccc7-c4c3)<-[n]3ccccc3-c3cc(-c4ccc(...
#1
TOP-1
0.06 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc(-c4ccccn4)[n]4->[Ru+2]56(<-[n]7ccccc7-c4c3)<-[n]3ccccc3-c3cc(-c4ccc(...
#2
0.00 ± 0.00
CC1=[N+]2C(=C(c3ccc(-c4cc(-c5ccccn5)nc(-c5ccccn5)c4)cc3)c3c(C)cc(C)n3[B-]2(F)F)[C]2(C)[Ru+2][CH]12
#2
0.00 ± 0.00
CC1=[N+]2C(=C(c3ccc(-c4cc(-c5ccccn5)nc(-c5ccccn5)c4)cc3)c3c(C)cc(C)n3[B-]2(F)F)[C]2(C)[Ru+2][CH]12
#2
0.00 ± 0.00
CC1=[N+]2C(=C(c3ccc(-c4cc(-c5ccccn5)nc(-c5ccccn5)c4)cc3)c3c(C)cc(C)n3[B-]2(F)F)[C]2(C)[Ru+2][CH]12
#2
0.00 ± 0.00
CC1=[N+]2C(=C(c3ccc(-c4cc(-c5ccccn5)nc(-c5ccccn5)c4)cc3)c3c(C)cc(C)n3[B-]2(F)F)[C]2(C)[Ru+2][CH]12
#2
0.00 ± 0.00
CC1=[N+]2C(=C(c3ccc(-c4cc(-c5ccccn5)nc(-c5ccccn5)c4)cc3)c3c(C)cc(C)n3[B-]2(F)F)[C]2(C)[Ru+2][CH]12
#2
0.00 ± 0.00
CC1=[N+]2C(=C(c3ccc(-c4cc(-c5ccccn5)nc(-c5ccccn5)c4)cc3)c3c(C)cc(C)n3[B-]2(F)F)[C]2(C)[Ru+2][CH]12
#2
0.00 ± 0.00
CC1=[N+]2C(=C(c3ccc(-c4cc(-c5ccccn5)nc(-c5ccccn5)c4)cc3)c3c(C)cc(C)n3[B-]2(F)F)[C]2(C)[Ru+2][CH]12
#2
0.00 ± 0.00
CC1=[N+]2C(=C(c3ccc(-c4cc(-c5ccccn5)nc(-c5ccccn5)c4)cc3)c3c(C)cc(C)n3[B-]2(F)F)[C]2(C)[Ru+2][CH]12
#2
0.00 ± 0.00
CC1=[N+]2C(=C(c3ccc(-c4cc(-c5ccccn5)nc(-c5ccccn5)c4)cc3)c3c(C)cc(C)n3[B-]2(F)F)[C]2(C)[Ru+2][CH]12
#3
0.00 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc4-c5cccc[n]5->[Ru+2]5(<-[n]6ccccc6-c(c3)n4)<-[n]3ccccc3-c3cc(-c4ccc(C...
#3
0.00 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc4-c5cccc[n]5->[Ru+2]5(<-[n]6ccccc6-c(c3)n4)<-[n]3ccccc3-c3cc(-c4ccc(C...
#3
0.00 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc4-c5cccc[n]5->[Ru+2]5(<-[n]6ccccc6-c(c3)n4)<-[n]3ccccc3-c3cc(-c4ccc(C...
#3
0.00 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc4-c5cccc[n]5->[Ru+2]5(<-[n]6ccccc6-c(c3)n4)<-[n]3ccccc3-c3cc(-c4ccc(C...
#3
0.00 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc4-c5cccc[n]5->[Ru+2]5(<-[n]6ccccc6-c(c3)n4)<-[n]3ccccc3-c3cc(-c4ccc(C...
#3
0.00 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc4-c5cccc[n]5->[Ru+2]5(<-[n]6ccccc6-c(c3)n4)<-[n]3ccccc3-c3cc(-c4ccc(C...
#3
0.00 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc4-c5cccc[n]5->[Ru+2]5(<-[n]6ccccc6-c(c3)n4)<-[n]3ccccc3-c3cc(-c4ccc(C...
#3
0.00 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc4-c5cccc[n]5->[Ru+2]5(<-[n]6ccccc6-c(c3)n4)<-[n]3ccccc3-c3cc(-c4ccc(C...
#3
0.00 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc4-c5cccc[n]5->[Ru+2]5(<-[n]6ccccc6-c(c3)n4)<-[n]3ccccc3-c3cc(-c4ccc(C...
#4
0.00 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc(-c4ccccn4)nc(-c4ncc[cH]5->[Ru+2]<-[cH]45)c3)cc1)c1c(C)cc(C)n1[B-]2(F...
#4
0.00 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc(-c4ccccn4)nc(-c4ncc[cH]5->[Ru+2]<-[cH]45)c3)cc1)c1c(C)cc(C)n1[B-]2(F...
#4
0.00 ± 0.00
CC1=CC(C)=[N+]2C1=C(c1ccc(-c3cc(-c4ccccn4)nc(-c4ncc[cH]5->[Ru+2]<-[cH]45)c3)cc1)c1c(C)cc(C)n1[B-]2(F...