109 research outputs found
Discrete Tomography of Penrose Model Sets
Various theoretical and algorithmic aspects of inverse problems in discrete
tomography of planar Penrose model sets are discussed. These are motivated by
the demand of materials science for the reconstruction of quasicrystalline
structures from a small number of images produced by quantitative high
resolution transmission electron microscopy.Comment: 7 pages, 1 figure; paper presented at Aperiodic 2006 (Zao, Japan
Tropical analogues of a Dempe-Franke bilevel optimization problem
We consider the tropical analogues of a particular bilevel optimization
problem studied by Dempe and Franke and suggest some methods of solving these
new tropical bilevel optimization problems. In particular, it is found that the
algorithm developed by Dempe and Franke can be formulated and its validity can
be proved in a more general setting, which includes the tropical bilevel
optimization problems in question. We also show how the feasible set can be
decomposed into a finite number of tropical polyhedra, to which the tropical
linear programming solvers can be applied.Comment: 11 pages, 1 figur
The K Group Nearest-Neighbor Query on Non-indexed RAM-Resident Data
Data sets that are used for answering a single query only once (or just a few times) before they are replaced by new data sets appear frequently in practical applications. The cost of buiding indexes to accelerate query processing would not be repaid for such data sets. We consider an extension of the popular (K) Nearest-Neighbor Query, called the (K) Group Nearest Neighbor Query (GNNQ). This query discovers the (K) nearest neighbor(s) to a group of query points (considering the sum of distances to all the members of the query group) and has been studied during recent years, considering data sets indexed by efficient spatial data structures. We study (K) GNNQs, considering non-indexed RAM-resident data sets and present an existing algorithm adapted to such data sets and two Plane-Sweep algorithms, that apply optimizations emerging from the geometric properties of the problem. By extensive experimentation, using real and synthetic data sets, we highlight the most efficient algorithm
On Simulated Annealing and the Construction of Linear Spline Approximations for Scattered Data
Abstract. We describe a method to create optimal linear spline approximations to arbitrary functions of one or two variables, given as scattered data without known connectivity. We start with an initial approximation consisting of a fixed number of vertices and improve this approximation by choosing different ver-tices, governed by a simulated annealing algorithm. In the case of one variable, the approximation is defined by line segments; in the case of two variables, the vertices are connected to define a Delaunay triangulation of the selected subset of sites in the plane. In a second version of this algorithm, specifically designed for the bivariate case, we choose vertex sets and also change the triangulation to achieve both optimal vertex placement and optimal triangulation. We then cre-ate a hierarchy of linear spline approximations, each one being a superset of all lower-resolution ones.
Murasaki: A Fast, Parallelizable Algorithm to Find Anchors from Multiple Genomes
BACKGROUND: With the number of available genome sequences increasing rapidly, the magnitude of sequence data required for multiple-genome analyses is a challenging problem. When large-scale rearrangements break the collinearity of gene orders among genomes, genome comparison algorithms must first identify sets of short well-conserved sequences present in each genome, termed anchors. Previously, anchor identification among multiple genomes has been achieved using pairwise alignment tools like BLASTZ through progressive alignment tools like TBA, but the computational requirements for sequence comparisons of multiple genomes quickly becomes a limiting factor as the number and scale of genomes grows. METHODOLOGY/PRINCIPAL FINDINGS: Our algorithm, named Murasaki, makes it possible to identify anchors within multiple large sequences on the scale of several hundred megabases in few minutes using a single CPU. Two advanced features of Murasaki are (1) adaptive hash function generation, which enables efficient use of arbitrary mismatch patterns (spaced seeds) and therefore the comparison of multiple mammalian genomes in a practical amount of computation time, and (2) parallelizable execution that decreases the required wall-clock and CPU times. Murasaki can perform a sensitive anchoring of eight mammalian genomes (human, chimp, rhesus, orangutan, mouse, rat, dog, and cow) in 21 hours CPU time (42 minutes wall time). This is the first single-pass in-core anchoring of multiple mammalian genomes. We evaluated Murasaki by comparing it with the genome alignment programs BLASTZ and TBA. We show that Murasaki can anchor multiple genomes in near linear time, compared to the quadratic time requirements of BLASTZ and TBA, while improving overall accuracy. CONCLUSIONS/SIGNIFICANCE: Murasaki provides an open source platform to take advantage of long patterns, cluster computing, and novel hash algorithms to produce accurate anchors across multiple genomes with computational efficiency significantly greater than existing methods. Murasaki is available under GPL at http://murasaki.sourceforge.net
Is Evolution of Blind Mole Rats Determined by Climate Oscillations?
The concept of climate variability facilitating adaptive radiation supported by the ‘‘Court Jester’’ hypothesis is disputed by the ‘‘Red Queen’’ one, but the prevalence of one or the other might be scale-dependent. We report on a detailed, comprehensive phylo-geographic study on the ,4 kb mtDNA sequence in underground blind mole rats of the family
Spalacidae (or subfamily Spalacinae) from the East Mediterranean steppes. Our study aimed at testing the presence of periodicities in branching patterns on a constructed phylogenetic tree and at searching for congruence between branching events, tectonic history and paleoclimates. In contrast to the strong support for the majority of the branching events on the tree, the absence of support in a few instances indicates that network-like evolution could exist in spalacids. In our tree, robust support was given, in concordance with paleontological data, for the separation of spalacids from muroid rodents
during the first half of the Miocene when open, grass-dominated habitats were established. Marine barriers formed between Anatolia and the Balkans could have facilitated the separation of the lineage ‘‘Spalax’’ from the lineage ‘‘Nannospalax’’ and of the clade ‘‘leucodon’’ from the clade ‘‘xanthodon’’. The separation of the clade ‘‘ehrenbergi’’ occurred during the late stages of the tectonically induced uplift of the Anatolian high plateaus and mountains, whereas the separation of the clade
‘‘vasvarii’’ took place when the rapidly uplifting Taurus mountain range prevented the Mediterranean rainfalls from reaching the Central Anatolian Plateau. The separation of Spalax antiquus and S. graecus occurred when the southeastern Carpathians were uplifted. Despite the role played by tectonic events, branching events that show periodicity corresponding to 400-kyr and 100-kyr eccentricity bands illuminate the important role of orbital fluctuations on adaptive radiation in spalacids. At the
given scale, our results supports the ‘‘Court Jester’’ hypothesis over the ‘‘Red Queen’’ one
Three-Dimensional Geometric Analysis of Felid Limb Bone Allometry
Studies of bone allometry typically use simple measurements taken in a small number of locations per bone; often the midshaft diameter or joint surface area is compared to body mass or bone length. However, bones must fulfil multiple roles simultaneously with minimum cost to the animal while meeting the structural requirements imposed by behaviour and locomotion, and not exceeding its capacity for adaptation and repair. We use entire bone volumes from the forelimbs and hindlimbs of Felidae (cats) to investigate regional complexities in bone allometry.Computed tomographic (CT) images (16435 slices in 116 stacks) were made of 9 limb bones from each of 13 individuals of 9 feline species ranging in size from domestic cat (Felis catus) to tiger (Panthera tigris). Eleven geometric parameters were calculated for every CT slice and scaling exponents calculated at 5% increments along the entire length of each bone. Three-dimensional moments of inertia were calculated for each bone volume, and spherical radii were measured in the glenoid cavity, humeral head and femoral head. Allometry of the midshaft, moments of inertia and joint radii were determined. Allometry was highly variable and related to local bone function, with joint surfaces and muscle attachment sites generally showing stronger positive allometry than the midshaft.Examining whole bones revealed that bone allometry is strongly affected by regional variations in bone function, presumably through mechanical effects on bone modelling. Bone's phenotypic plasticity may be an advantage during rapid evolutionary divergence by allowing exploitation of the full size range that a morphotype can occupy. Felids show bone allometry rather than postural change across their size range, unlike similar-sized animals
- …