Recruitment constraints in Singapore's fluted giant clam (Tridacna squamosa) population--a dispersal model approach.

Recruitment constraints on Singapore's dwindling fluted giant clam, Tridacna squamosa, population were studied by modelling fertilisation, larval transport, and settlement using real-time hydrodynamic forcing combined with knowledge of spawning characteristics, larval development, behaviour, and settlement cues. Larval transport was simulated using a finite-volume advection-diffusion model coupled to a three-dimensional hydrodynamic model. Three recruitment constraint hypotheses were tested: 1) there is limited connectivity between Singapore's reefs and other reefs in the region, 2) there is limited exchange within Singapore's Southern Islands, and 3) there exist low-density constraints to fertilisation efficacy (component Allee effects). Results showed that connectivity among giant clam populations was primarily determined by residual hydrodynamic flows and spawning time, with greatest chances of successful settlement occurring when spawning and subsequent larval dispersal coincided with the period of lowest residual flow. Simulations suggested poor larval transport from reefs located along the Peninsular Malaysia to Singapore, probably due to strong surface currents between the Andaman Sea and South China Sea combined with a major land barrier disrupting larval movement among reefs. The model, however, predicted offshore coral reefs to the southeast of Singapore (Bintan and Batam) may represent a significant source of larvae. Larval exchange within Singapore's Southern Islands varied substantially depending on the locations of source and sink reefs as well as spawning time; but all simulations resulted in low settler densities (2.1-68.6 settled individuals per 10,000 m(2)). Poor fertilisation rates predicted by the model indicate that the low density and scattered distribution of the remaining T. squamosa in Singapore are likely to significantly inhibit any natural recovery of local stocks.

Abstract licence: CC BY

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.