Genetic isolation and morphological divergence of Black Sea bottlenose dolphins

The Black Sea is a semi-enclosed body of water that differs from the adjacent Mediterranean Sea in terms of its biodiversity, oceanographical and ecological characteristics. There is growing international concern about pollution in the Black Sea and other anthropogenic threats to its fauna. The bottlenose dolphin (Tursiops truncatus) is one of three species of cetaceans living in the Azov-Black Sea basin. Despite considerable research on bottlenose dolphins elsewhere, the extent of human impacts on the Black Sea populations is unknown. Previous attempts to award special conservation status to Black Sea cetaceans have failed specifically because policy makers have viewed their ecological and evolutionary uniqueness as equivocal. This study assessed divergence between Black Sea, Mediterranean Sea and Atlantic Ocean bottlenose dolphins for 26 cranial measurements (n = 75 adult bottlenose dolphin skulls) and mitochondrial DNA (n = 99 individuals). Black Sea bottlenose dolphins are smaller than those in the Mediterranean, and possess a uniquely shaped skull. As in a previous study, we found the Black Sea population to be genetically distinct, with relatively low levels of mtDNA diversity. Population genetic models suggest that Black Sea bottlenose dolphins have so little gene flow with the Mediterranean due to historical isolation that they should be managed separately.

Review of the Evidence Used In The Description Of Currently Recognized Cetacean Subspecies

We reviewed the subspecies listed by Rice (1998) and those described since (a total of 49, in 19 species), assessing them against the criteria recommended by the recent Workshop on Shortcomings of Cetacean Taxonomy in Relation to Needs of Conservation and Management (Reeves et al., 2004). The workshop suggested that the subspecies concept can be construed to cover two types of entities: a) lineages diverging but not quite far along the continuum of divergence (still having significant gene flow with another lineage or lineages) to be judged as species, and b) lineages that may well be species but for which not enough evidence is yet available to justify their designation as such. As a criterion for support of a subspecies, the workshop suggested as a guideline that there be at least one good line of either morphological or appropriate genetic evidence. "Appropriate" was not defined; the recommendation was that that be left up to the taxonomist authors of subspecies and to their professional peers. A further recommendation was that evidence on distribution, behavior and ecology should be considered not as primary but as supporting evidence, as there was not agreement at the workshop that such characters are necessarily stable (in the case of distribution) or inherent (behavior and ecology).

Approximation Algorithms for Survivable Multicommodity Flow Problems with Applications to Network Design

Multicommodity flow (MF) problems have a wide variety of applications in areas such as VLSI circuit design, network design, etc., and are therefore very well studied. The fractional MF problems are polynomial time solvable while integer versions are NP-complete. However, exact algorithms to solve the fractional MF problems have high computational complexity. Therefore approximation algorithms to solve the fractional MF problems have been explored in the literature to reduce their computational complexity. Using these approximation algorithms and the randomized rounding technique, polynomial time approximation algorithms have been explored in the literature. In the design of high-speed networks, such as optical wavelength division multiplexing (WDM) networks, providing survivability carries great significance. Survivability is the ability of the network to recover from failures. It further increases the complexity of network design and presents network designers with more formidable challenges. In this work we formulate the survivable versions of the MF problems. We build approximation algorithms for the survivable multicommodity flow (SMF) problems based on the framework of the approximation algorithms for the MF problems presented in [1] and [2]. We discuss applications of the SMF problems to solve survivable routing in capacitated networks.