@inbook{3573,
abstract = {Given a finite point set in R, the surface reconstruction problem asks for a surface that passes through many but not necessarily all points. We describe an unambigu- ous definition of such a surface in geometric and topological terms, and sketch a fast algorithm for constructing it. Our solution overcomes past limitations to special point distributions and heuristic design decisions.},
author = {Herbert Edelsbrunner},
booktitle = {Discrete & Computational Geometry},
pages = {379 -- 404},
publisher = {Springer},
title = {{Surface reconstruction by wrapping finite sets in space}},
doi = {10.1007/978-3-642-55566-4_17},
year = {2003},
}
@article{3584,
abstract = {We develop fast algorithms for computing the linking number of a simplicial complex within a filtration.We give experimental results in applying our work toward the detection of non-trivial tangling in biomolecules, modeled as alpha complexes.},
author = {Edelsbrunner, Herbert and Zomorodian, Afra},
journal = {Homology, Homotopy and Applications},
number = {2},
pages = {19 -- 37},
publisher = {International Press},
title = {{Computing linking numbers of a filtration}},
volume = {5},
year = {2003},
}
@article{3593,
abstract = {Temporal logics such as Computation Tree Logic (CTL) and Linear Temporal Logic (LTL) have become popular for specifying temporal properties over a wide variety of planning and verification problems. In this paper we work towards building a generalized framework for automated reasoning based on temporal logics. We present a powerful extension of CTL with first-order quantification over the set of reachable states for reasoning about extremal properties of weighted labeled transition systems in general. The proposed logic, which we call Weighted Quantified Computation Tree Logic (WQCTL), captures the essential elements common to the domain of planning and verification problems and can thereby be used as an effective specification language in both domains. We show that in spite of the rich, expressive power of the logic, we are able to evaluate WQCTL formulas in time polynomial in the size of the state space times the length of the formula. Wepresent experimental results on the WQCTL verifier.},
author = {Krishnendu Chatterjee and Dasgupta, Pallab and Chakrabarti, Partha P},
journal = {Journal of Automated Reasoning},
number = {2},
pages = {205 -- 232},
publisher = {Springer},
title = {{A branching time temporal framework for quantitative reasoning}},
doi = {10.1023/A:1023217515688},
volume = {30},
year = {2003},
}
@article{3618,
abstract = {There are several analyses in evolutionary ecology which assume that a family of offspring has come from only two parents. Here, we present a simple test for detecting when a batch involves two or more subfamilies. It is based on the fact that the mixing of families generates associations amongst unlinked marker loci. We also present simulations illustrating the power of our method for varying numbers of loci, alleles per locus and genotyped individuals.},
author = {Vines, Timothy H and Nicholas Barton},
journal = {Molecular Ecology},
number = {7},
pages = {1999 -- 2002},
publisher = {Wiley-Blackwell},
title = {{A new approach to detecting mixed families}},
doi = {10.1046/j.1365-294X.2003.01867.x},
volume = {12},
year = {2003},
}
@article{3619,
abstract = {What is the chance that some part of a stretch of genome will survive? In a population of constant size, and with no selection, the probability of survival of some part of a stretch of map length y<1 approaches View the MathML source for View the MathML source. Thus, the whole genome is certain to be lost, but the rate of loss is extremely slow. This solution extends to give the whole distribution of surviving block sizes as a function of time. We show that the expected number of blocks at time t is 1+yt and give expressions for the moments of the number of blocks and the total amount of genome that survives for a given time. The solution is based on a branching process and assumes complete interference between crossovers, so that each descendant carries only a single block of ancestral material. We consider cases where most individuals carry multiple blocks, either because there are multiple crossovers in a long genetic map, or because enough time has passed that most individuals in the population are related to each other. For species such as ours, which have a long genetic map, the genome of any individual which leaves descendants (∼80% of the population for a Poisson offspring number with mean two) is likely to persist for an extremely long time, in the form of a few short blocks of genome.},
author = {Baird, Stuart J and Nicholas Barton and Etheridge, Alison M},
journal = {Theoretical Population Biology},
number = {4},
pages = {451 -- 471},
publisher = {Academic Press},
title = {{The distribution of surviving blocks of an ancestral genome}},
doi = {10.1016/S0040-5809(03)00098-4},
volume = {64},
year = {2003},
}