Engineering 2

Centromeric DNA is critical for accurate chromosome segregation and genome stability, but due to its repetitive nature, it was only recently fully included in a human reference. Rapid evolution and sequence diversity in these regions limit the utility of one reference sequence, however. Integrating centromeric and pericentromeric satellite DNA – which together constitute over 5% […]

Pattern counting is a fundamental problem in computer science with applications in many domains. For a fixed small pattern H, we are given a large graph G and we are asked to count the number of subgraphs or homomorphisms (edge-preserving maps) of H in G. For practical applications where the input graph can be very […]

Research on fault-tolerance protocols for approximate Byzantine agreement (ABA) has largely focused on ensuring that distributed processes remain consistent despite fewer than 1/3 faulty processes. Yet in many real systems, consistency is only useful when it enables processes to make accurate decisions from replicated, noisy, and potentially adversarially corrupted data relative to an ideal fault-free […]

Most optimization problems face the challenge of computing an optimum solution requiring superpolynomial time. In particular, they are classified as NP-hard problems that have no polynomial-time algorithm to date. Instead, computer scientists turn to find an approximate solution and create numerous elegant algorithms. However, in the modern era, computational environments have changed drastically, and we […]

Oceanographic data, generated by modern technologies that measure biological systems across time, space, and cell populations, are often rich, high-dimensional, and highly heterogeneous. Such data provide valuable opportunities to study subcellular organization, cellular heterogeneity, and dynamic biological processes in marine environments. However, because marine plankton systems remain relatively understudied and less well characterized than many […]