Anti-Fibrinopeptide B polyclonal antibody

Many neotropical species have a complex history of diversification as a result of the influence of geographical, ecological, climatic, and geological factors that determine the distribution of populations within a lineage. Phylogeography identifies such populations, determines their geographic distributions, and quantifies the degree of genetic divergence. In this work we explored the genetic structure of Habia rubica populations, a polytypic taxon with 17 subspecies described, in order to obtain hypotheses about their evolutionary history and processes of diversification. We undertook multilocus analyses using sequences of five molecular markers (ND2, ACOI-I9, MUSK, FGB-I5 and ODC), and sampling from across the species' distribution range, an area encompassing from Central Mexico throughout much of South America. With these data, we obtained a robust phylogenetic hypothesis, a species delimitation analysis, and estimates of divergence times for these lineages. The phylogenetic hypothesis of concatenated molecular markers shows that H. rubica can be divided in three main clades: the first includes Mexican Pacific coast populations, the second is formed by population from east of Mexico to Panama and the third comprises the South American populations. Within these clades we recognize seven principal phylogroups whose limits have a clear correspondence with important geographical discontinuities including the Isthmus of Tehuantepec in southern Mexico, the Talamanca Cordillera, and the Isthmus of Panama in North America. In South America, we observed a marked separation of two phylogroups that include the populations that inhabit mesic forests in western and central South America (Amazon Forest) and those inhabiting the seasonal forest from the eastern and northern regions of the South America (Atlantic Forest). These areas are separated by an intervening dry vegetation "diagonal" (Chaco, Cerrado and Caatinga). The geographic and genetic structure of these phylogroups describes a history of diversification more active and complex in the northern distribution of this species, producing at least seven well-supported lineages that could be considered species.

Let I subset of K[x(1), ... , x(n)] be a 0-dimensional ideal of degree D where K is a field. It is well-known that obtaining efficient algorithms for change of ordering of Grobner bases of I is crucial in polynomial system solving. Through the algorithm FGLM, this task is classically tackled by linear algebra operations in K[x(1), ... , x(n)]/I. With recent progress on Grobner bases computations, this step turns out to be the bottleneck of the whole solving process. Our contribution is an algorithm that takes advantage of the sparsity structure of multiplication matrices appearing during the change of ordering. This sparsity structure arises even when the input polynomial system defining I is dense. As a by-product, we obtain an implementation which is able to manipulate 0-dimensional ideals over a prime field of degree greater than 30000. It outperforms the Magma/Singular/FGb implementations of FGLM. First, we investigate the particular but important shape position case. The obtained algorithm performs the change of ordering within a complexity O(D(N-1 + n log(D))), where N-1 is the number of nonzero entries of a multiplication matrix. This almost matches the complexity of computing the minimal polynomial of one multiplication matrix. Then, we address the general case and give corresponding complexity results. Our algorithm is dynamic in the sense that it selects automatically which strategy to use depending on the input. Its key ingredients are the Wiedemann algorithm to handle 1-dimensional linear recurrence (for the shape position case), and the Berlekamp-Massey-Sakata algorithm from Coding Theory to handle multi-dimensional linearly recurring sequences in the general case.