Skip to main content
Anastasia Ivanova on Muck Rack

Anastasia Ivanova

As seen in: Medium, Wiley Online Library, MDPI, SAGE Publishing, Taylor & Francis Online, Cell Press, The Lancet, Pediatrics, Bit Rebels, The Journal of Allergy & Clinical Immunology and

Get in touch with Anastasia

Contact Anastasia, search articles and posts on X, monitor coverage, and track replies from one place.

Learn more about Muck Rack

Actions

Share this page

Articles

Dynamic borrowing methods for basket trials with order restrictions

|
By Lauren G. Kanapka, Anastasia Ivanova
| Taylor & Francis Online
The purpose of a basket trial is to evaluate a new therapy in multiple populations under the same protocol. Each population, referred to as a “basket”, can be defined by disease type, biomarkers, or other patient characteristics. In some basket trials we may have information about the order of the response between baskets. For example, consider a basket trial of a cancer drug where the baskets are defined by tumor type and levels of a biomarker.
Open in Who Shared Issue with article?

Dynamic prediction by landmarking with data from cohort subsampling designs

|
By Yen Chang, Anastasia Ivanova, Demetrius Albanes, Jason Fine
| SAGE Publishing
Abstract Longitudinal data are often available in cohort studies and clinical settings, such as covariates collected at cohort follow-up visits or prescriptions captured in electronic health records. Such longitudinal information, if correlates with the health event of interest, may be incorporated to dynamically predict the probability of a health event with better precision. Landmarking is a popular approach to dynamic prediction.
Open in Who Shared Issue with article?

Optimality Considerations in Two‐Stage Biomarker‐Stratified Trials With Adaptive Enrichment

|
By Lang Li, Anastasia Ivanova
| Wiley Online Library Verified
Conflicts of Interest The authors declare no conflicts of interest. Data Availability Statement Data sharing not applicable to this article as no datasets were generated or analyzed during the current study. Supporting Information Filename Description sim70318-sup-0001-Appendix.docxWord 2007 document , 57.7 KB Appendix S1: Optimal designs minimizing N max = $$ {N}_{\mathrm{max}}= $$ max N , N 1 + N E $$ \max \left(N,{N}_1+{N}_E\right) $$ .
Open in Who Shared Issue with article?
See all 81 articles