Finding Pfiesteria fast.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pfiesteria piscicida and Dinoflagellates Similar to Pfiesteria

Pfiesteria pisiccida is a microscopic, unicellular organism that is classified as both a mixotrophic and heterotrophic dinoflagellate, which has been associated with both fish deaths and a cause of human illness (Burkholder et al., 1992; Glasgow et al., 1995; Burkholder and Glasgow, 1997). This species possesses a complex life cycle that includes motile forms (e.g. zoospores, gametes, amoebae) ...

متن کامل

Classification and identification of Pfiesteria and Pfiesteria-like species.

Dinoflagellates can be classified both botanically and zoologically; however, they are typically put in the botanical division Pyrrhophyta. As a group they appear most related to the protistan ciliates and apicomplexans at the ultrastructure level. Within the Pyrrhophyta are both unarmored and armored forms of the dominant, motile flagellated stage. Unarmored dinoflagellates do not have thecal ...

متن کامل

Finding Facilities Fast

Clustering can play a critical role in increasing the performance and lifetime of wireless networks. The facility location problem is a general abstraction of the clustering problem and this paper presents the first constant-factor approximation algorithm for the facility location problem on unit disk graphs (UDGs), a commonly used model for wireless networks. In this version of the problem, co...

متن کامل

Finding the Right Match Fast

DNA recombinases face the daunting task of locating and pairing up specific sequences among millions of base pairs in a genome, all within about an hour. Qi et al. show that recombinases solve this problem by searching in 8-nt microhomology units, reducing the search space and accelerating the homology search.

متن کامل

Fast Finding of 2-clubs

The main contributions that are put forward in this thesis will be described shortly. 1. Instead of computing the largest 2-club in a network, all 2-clubs in a network are computed. In addition, this set of 2-clubs is classified, ordered and clustered. Here the characterization by Mokken [13] is used. 2. The running times of the known algorithms and the ones proposed this thesis are evaluated o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Environmental Health Perspectives

سال: 2001

ISSN: 0091-6765,1552-9924

DOI: 10.1289/ehp.109-a67a