Spectral ordering and biochronology of European fossil mammals

نویسندگان

  • Mikael Fortelius
  • Aristides Gionis
  • Jukka Jernvall
  • Heikki Mannila
چکیده

—Spectral algorithms have been shown to work well in a wide range of situations that involve the task of ordering. When applied to the localities of a set of European Neogene land mammal taxa, spectral ordering relies almost entirely on the most common genera, depends on connectivity more than on length of taxon lists, and is robust to noise from rarer and less connected taxa. The spectral coefficients for localities are highly correlated with known geochronological ages. Although elementary compared with more sophisticated biochronological tools, spectral ordering allows a fast and standardized way to generate biochronological ordering of localities when other information than faunal lists is lacking. Compared with the conventional mammal Neogene (MN) units, spectral ordering of localities appears to lack distinct temporal boundaries in taxon content and render a much lower count of Lazarus events. If, as seems to be the case, biochronology depends mainly on the most common taxa and if evolutionary change is also most clearly reflected in them, then the main evolutionary patterns should be detectable at a modest level of sampling. Mikael Fortelius.* Department of Geology and Institute of Biotechnology, Post Office Box 64, FIN-00014 University of Helsinki, Finland. E-mail: [email protected] Aristides Gionis and Heikki Mannila. HIIT Basic Research Unit, Department of Computer Science, Post Office Box 68, FIN-00014 University of Helsinki, Finland Jukka Jernvall. Developmental Biology Program, Institute of Biotechnology, Post Office Box 56, FIN-00014 University of Helsinki, Helsinki, Finland and Department of Ecology and Systematics, Post Office Box 65, FIN-00014 University of Helsinki, Finland *Corresponding author Accepted: 7 September 2005

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

ثبت نام

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

منابع مشابه

Seriation in Paleontological Data Using Markov Chain Monte Carlo Methods

Given a collection of fossil sites with data about the taxa that occur in each site, the task in biochronology is to find good estimates for the ages or ordering of sites. We describe a full probabilistic model for fossil data. The parameters of the model are natural: the ordering of the sites, the origination and extinction times for each taxon, and the probabilities of different types of erro...

متن کامل

Diachrony of mammalian appearance events : Implications for biochronology : Comments and Reply

Alroy (1998) argued that there is significant diachrony in the first and last appearance events (FAE and LAE) of Cenozoic mammals in North America, and therefore individual events cannot be used for biochronology. A close examination of the data used in his paper, however, suggests that (1) most of the diachrony is largely a sampling artifact, and (2) once sampling is factored out, the remainin...

متن کامل

Early human occupation of Western Europe: paleomagnetic dates for two paleolithic sites in Spain.

The lacustrine deposits infilling the intramontane Guadix-Baza Basin, in the Betic Range of Southern Spain, have yielded abundant well-preserved lithic artifacts. In addition, the lake beds contain a wide range of micromammals including Mimomys savini and Allophaiomys burgondiae and large mammals such as Mammuthus and Hippopotamus together with the African saber-toothed felid Megantereon. The a...

متن کامل

SIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM

Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$  and  $A(G)$ the adjacency matrix of $G$. The  signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of  graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...

متن کامل

Lexicographical ordering by spectral moments of trees with a given bipartition

 Lexicographic ordering by spectral moments ($S$-order) among all trees is discussed in this‎ ‎paper‎. ‎For two given positive integers $p$ and $q$ with $pleqslant q$‎, ‎we denote $mathscr{T}_n^{p‎, ‎q}={T‎: ‎T$ is a tree of order $n$ with a $(p‎, ‎q)$-bipartition}‎. Furthermore, ‎the last four trees‎, ‎in the $S$-order‎, ‎among $mathscr{T}_n^{p‎, ‎q},(4leqslant pleqslant q)$ are characterized‎.

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006