Suresh Andrew Sethi, PhD (Former Employee)

Species distribution models (SDMs) are commonly used to model the spatial structure of species in the marine environment, however, most fail to account for detectability of the target species. This can result in underestimates of occupancy, where nondetection is conflated with absence. The site occupancy model (SOM) overcomes this failure by treating occupancy as a latent variable of the...

A history of overexploitation and industrialization of riverine habitats has impacted the Shortnose Sturgeon Acipenser brevirostrum, leading this species to become one of the earliest listed under the U.S. Endangered Species Act. The present understanding of Shortnose Sturgeon spatial ecology is based on observations from a limited number of Atlantic coastal rivers. To better understand...

Mixtures of DNA from multiple contributors present a novel opportunity to count individuals to inform fish and wildlife ecology.We apply a likelihood-based framework to estimate the number of contributors to a DNA mixture for ecological applications. We then assess the performance of DNA mixture estimation through a combination of simulation analyses, laboratory testing, and a field...

The spawning migration travel times of chum salmon, Oncorhynchus keta (Walbaum), fitted with gastrically implanted radio tags vs external spaghetti tags were tested for a short [≈60 river km (rkm)] and long migration route (≈730 rkm) on the Koyukuk River, Alaska, USA. Using a novel application of statistical arrival curve models to infer travel times for uncaptured fish, migrations by...

We provide an exact and approximation algorithm based on Dynamic Programming and an approximation algorithm based on Mixed Integer Programming for optimizing for the so-called dendritic connectivity on tree-structured networks in a multi-objective setting. Dendritic connectivity describes the degree of connectedness of a network. We consider different variants of dendritic connectivity...

Real–world problems are often not fully characterized by a single optimal solution, as they frequently involve multiple competing objectives; it is therefore important to identify the so-called Pareto frontier, which captures solution trade-offs. We propose a fully polynomial-time approximation scheme based on Dynamic Programming (DP) for computing a polynomially succinct curve that...