BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
PRODID:-//Telerik Inc.//Sitefinity CMS 15.4//EN
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
DTSTART;VALUE=DATE:20250101
TZNAME:UTC
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DESCRIPTION:Date: Tuesday 18th November 2025\nTime:&nbsp\;14:00 - 15:00 GMT
  | 9:00 - 10:00 EST (US)\nLocation:&nbsp\;Online via Zoom\nSpeakers:&nbsp\
 ;Davit Sargsyan\n\nWho is this event intended for?:&nbsp\;Statisticians an
 d Scientists involved or interested in randomization techniques in pre-cli
 nical and early clinical studies.\n\n\nWhat is the benefit of attending?: 
 Hearing about modern randomization methods.\nCost\nThis webinar is free to
  both Members of PSI and Non-Members.\nRegistration\nTo register for this 
 event\, please click here\nOverview\nIn both\, clinical and preclinical st
 udies randomizing subjects to treatment groups is a key part of the study 
 design. This step minimizes the risk of confounding. For large studies\, c
 omplete randomization is often enough to ensure that treatment groups are 
 similar. However\, for small clinical trials and especially for in vivo st
 udies this approach is riskier. More elaborate randomization techniques ca
 n be applied for those studies such as randomized block design. However\, 
 the best results are achieved when algorithmic approach to subject allocat
 ion is taken. One such approach is based on genetic algorithm that is root
 ed in Theory of Evolution. The methodology minimizes the fitness function 
 criteria for partitions of a dataset into balanced subgroups. The performa
 nce of the algorithm was compared to random allocation and the exhaustive 
 search using synthetic and real-world data. The results showed that experi
 mental groups created by this algorithm were more homogeneous compared tho
 se created by exhaustive search. Additionally\, this algorithm is signific
 antly less expensive computationally compared to the exhaustive search\, a
 nd the efficiency gains increase rapidly as the number of subjects and des
 ign factors increase. We will discuss the theory behind this approach as w
 ell as the extensions and variations of the algorithm such as simulated an
 nealing. \nSpeaker details\n\n\n\n    \n        \n            \n          
   Speaker\n            \n            \n            Biography\n            
 \n            \n            Abstract\n            \n        \n        \n  
           \n            Davit Sargsyan\, Johnson &amp\; Johnson\n         
    Davit Sargsyan is an associate director in a nonclinical statistics gro
 up at J&amp\;J Innovative Medicine\, mainly supporting Immunology Discover
  R&amp\;D. He received an MS in statistics and completed his PhD in pharma
 ceutical sciences at Rutgers University. To date\, Davit has co-published 
 over 70 scientific articles in peer-reviewed journals on topics ranging fr
 om clinical outcomes of cardiovascular patients using a state-wide hospita
 l admission data registry to natural compounds testing in in vivo and in v
 itro models. Davit&rsquo\;s research at Rutgers School of Pharmacy concent
 rated on computational methods and visualization of omics data studying th
 e effect of dietary phytochemicals on epigenome\, transcriptome and microb
 iome.\n            &nbsp\;Modern Algorithms for Animal Randomization in Pr
 eclinical Studies\n            In both\, clinical and preclinical studies 
 randomizing subjects to treatment groups is a key part of the study design
 . This step minimizes the risk of confounding. For large studies\, complet
 e randomization is often enough to ensure that treatment groups are simila
 r. However\, for small clinical trials and especially for in vivo studies 
 this approach is riskier. More elaborate randomization techniques can be a
 pplied for those studies such as randomized block design. However\, the be
 st results are achieved when algorithmic approach to subject allocation is
  taken. One such approach is based on genetic algorithm that is rooted in 
 Theory of Evolution. The methodology minimizes the fitness function criter
 ia for partitions of a dataset into balanced subgroups. The performance of
  the algorithm was compared to random allocation and the exhaustive search
  using synthetic and real-world data. The results showed that experimental
  groups created by this algorithm were more homogeneous compared those cre
 ated by exhaustive search. Additionally\, this algorithm is significantly 
 less expensive computationally compared to the exhaustive search\, and the
  efficiency gains increase rapidly as the number of subjects and design fa
 ctors increase. We will discuss the theory behind this approach as well as
  the extensions and variations of the algorithm such as simulated annealin
 g.\n        \n    \n\n
DTEND:20251118T150000Z
DTSTAMP:20260908T034431Z
DTSTART:20251118T140000Z
LOCATION:
SEQUENCE:0
SUMMARY:Pre-Clinical SIG Webinar: Modern Algorithms for Animal Randomizatio
 n in Preclinical Studies
UID:RFCALITEM639244358710735676
X-ALT-DESC;FMTTYPE=text/html:<strong>Date: </strong>Tuesday 18th November 2
 025<br />\n<strong>Time:</strong>&nbsp\;14:00 - 15:00 GMT | 9:00 - 10:00 E
 ST (US)<br />\n<strong>Location:</strong>&nbsp\;Online via Zoom<br />\n<st
 rong>Speakers:&nbsp\;<em></em></strong><em>Davit Sargsyan</em><br />\n<br 
 />\n<strong>Who is this event intended for?:&nbsp\;</strong>Statisticians 
 and Scientists involved or interested in randomization techniques in pre-c
 linical and early clinical studies.<strong><br />\n</strong><strong>\n<br 
 />\nWhat is the benefit of attending?: </strong>Hearing about modern rando
 mization methods.<br />\n<h4>Cost</h4>\n<p>This webinar is free to both Me
 mbers of PSI and Non-Members.</p>\n<h4>Registration</h4>\n<p>To register f
 or this event\, please <strong><span style="text-decoration: underline\;">
 <a href="https://psi.glueup.com/event/maths-meets-medicine-exploring-caree
 rs-in-the-pharmaceutical-industry-130333"></a><a href="https://psi.glueup.
 com/event/pre-clinical-sig-webinar-modern-algorithms-for-animal-randomizat
 ion-in-preclinical-studies-159661/" target="_blank"><strong><span style="t
 ext-decoration: underline\;">click here</span></strong></a></span></strong
 ></p>\n<h4>Overview</h4>\n<p>In both\, clinical and preclinical studies ra
 ndomizing subjects to treatment groups is a key part of the study design. 
 This step minimizes the risk of confounding. For large studies\, complete 
 randomization is often enough to ensure that treatment groups are similar.
  However\, for small clinical trials and especially for in vivo studies th
 is approach is riskier. More elaborate randomization techniques can be app
 lied for those studies such as randomized block design. However\, the best
  results are achieved when algorithmic approach to subject allocation is t
 aken. One such approach is based on genetic algorithm that is rooted in Th
 eory of Evolution. The methodology minimizes the fitness function criteria
  for partitions of a dataset into balanced subgroups. The performance of t
 he algorithm was compared to random allocation and the exhaustive search u
 sing synthetic and real-world data. The results showed that experimental g
 roups created by this algorithm were more homogeneous compared those creat
 ed by exhaustive search. Additionally\, this algorithm is significantly le
 ss expensive computationally compared to the exhaustive search\, and the e
 fficiency gains increase rapidly as the number of subjects and design fact
 ors increase. We will discuss the theory behind this approach as well as t
 he extensions and variations of the algorithm such as simulated annealing.
  </p>\n<h4>Speaker details</h4>\n<table border="1" cellspacing="0" cellpad
 ding="0">\n</table>\n<table>\n    <tbody>\n        <tr>\n            <td v
 align="top">\n            <p><strong><span style="font-size: 12px\; font-f
 amily: Arial\;">Speaker</span></strong></p>\n            </td>\n          
   <td valign="top">\n            <p><span style="font-size: 12px\; font-fa
 mily: Arial\;"><strong>Biography</strong></span></p>\n            </td>\n 
            <td valign="top">\n            <p><span style="font-size: 12px\
 ; font-family: Arial\;"><strong>Abstract</strong><em><strong></strong></em
 ></span></p>\n            </td>\n        </tr>\n        <tr>\n            
 <td valign="top"><em><img src="https://www.psiweb.org/images/default-sourc
 e/default-album/davit_headshot_2025.png?sfvrsn=be9caedb_0&amp\;sf_site_tem
 p=true&amp\;sf_site=00000000-0000-0000-0000-000000000000&amp\;MaxWidth=500
 &amp\;MaxHeight=500&amp\;ScaleUp=false&amp\;Quality=High&amp\;Method=Resiz
 eFitToAreaArguments&amp\;Signature=F7A7D7B7A55F84736C12D9429D43A816" data-
 displaymode="Custom" alt="Davit_Headshot_2025" title="Davit_Headshot_2025"
  data-method="ResizeFitToAreaArguments" data-customsizemethodproperties="{
 'MaxWidth':'500'\,'MaxHeight':'500'\,'ScaleUp':false\,'Quality':'High'}" /
 ><br />\n            Davit Sargsyan\, Johnson &amp\; Johnson</em></td>\n  
           <td valign="top">Davit Sargsyan is an associate director in a no
 nclinical statistics group at J&amp\;J Innovative Medicine\, mainly suppor
 ting Immunology Discover R&amp\;D. He received an MS in statistics and com
 pleted his PhD in pharmaceutical sciences at Rutgers University. To date\,
  Davit has co-published over 70 scientific articles in peer-reviewed journ
 als on topics ranging from clinical outcomes of cardiovascular patients us
 ing a state-wide hospital admission data registry to natural compounds tes
 ting in in vivo and in vitro models. Davit&rsquo\;s research at Rutgers Sc
 hool of Pharmacy concentrated on computational methods and visualization o
 f omics data studying the effect of dietary phytochemicals on epigenome\, 
 transcriptome and microbiome.</td>\n            <td valign="top">&nbsp\;<s
 trong>Modern Algorithms for Animal Randomization in Preclinical Studies<br
  />\n            </strong>In both\, clinical and preclinical studies rando
 mizing subjects to treatment groups is a key part of the study design. Thi
 s step minimizes the risk of confounding. For large studies\, complete ran
 domization is often enough to ensure that treatment groups are similar. Ho
 wever\, for small clinical trials and especially for in vivo studies this 
 approach is riskier. More elaborate randomization techniques can be applie
 d for those studies such as randomized block design. However\, the best re
 sults are achieved when algorithmic approach to subject allocation is take
 n. One such approach is based on genetic algorithm that is rooted in Theor
 y of Evolution. The methodology minimizes the fitness function criteria fo
 r partitions of a dataset into balanced subgroups. The performance of the 
 algorithm was compared to random allocation and the exhaustive search usin
 g synthetic and real-world data. The results showed that experimental grou
 ps created by this algorithm were more homogeneous compared those created 
 by exhaustive search. Additionally\, this algorithm is significantly less 
 expensive computationally compared to the exhaustive search\, and the effi
 ciency gains increase rapidly as the number of subjects and design factors
  increase. We will discuss the theory behind this approach as well as the 
 extensions and variations of the algorithm such as simulated annealing.</t
 d>\n        </tr>\n    </tbody>\n</table>\n<br />
END:VEVENT
END:VCALENDAR
