MOTIVATION When two or more genomic maps of a chromosomal region are available, it is useful to be able to synthesize them to create a merged map. RESULTS We show that map merging is an exploratory process because there are multiple ways to combine data based upon what the user wishes to focus on, and upon which particular data subset emphasis is desired. We describe Mapmerge, a program for m...

The generative revolution in linguistics, started in the 1950s, culminated around 1980, when it was demonstrated that “rules of grammar” were not construction-specific, as had been believed since Antiquity, but following from the interactions of various constructionindependent principles. Perhaps most important among those principles were the locality principles, with such well-known highlights...

We initiate the formal study of the online stack-compaction policies used by big-data NoSQL databases such as Google Bigtable, Hadoop HBase, and Apache Cassandra. We propose a deterministic policy, show that it is optimally competitive, benchmark it against Bigtable’s default policy, and suggest five interesting open problems.

Multi-sample anti-aliasing is a popular technique for reducing geometric aliasing (jagged edges) and is supported in all modern graphics processors. With multi-sampling anti-aliasing, visibility and depth are sampled more than once per pixel, while shading is done only once per pixel per primitive. Although this significantly reduces the appearance of jagged edges around object boundaries, the ...

This paper describes a method for merging behavior specifications modeled by transition systems. Given two behavior specifications B1 and B2, Merge(B1, B2) defines a new behavior specification that extends B1 and B2. Moreover, provided that a necessary and sufficient condition holds, Merge(B1, B2) is a cyclic extension of B1 and B2. In other words, Merge(B1, B2) extends B1 and B2, and any cycli...

This paper introduces decorated merge trees (DMTs) as a novel invariant for persistent spaces. DMTs combine both $$\pi _0$$ and $$H_n$$ information into single data structure that distinguishes filtrations homology cannot distinguish alone. Three variants on DMTs, which emphasize category theory, representation theory persistence barcodes, respectively, offer different advantages in terms of co...

In this paper, we study merge trees induced by a discrete Morse function on tree. Given function, provide method to constructing an tree and define new notion of equivalence functions based the We then relate matching number certain invariant Finally, count that can be star graph characterize