Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: PRJNA685538 Cyprinodon brontotheroides isolate:CRPMF4-2017 Genome sequencing and assembly
A de novo assembly of C. bronthotheroides reference genome used for understanding the temporal and spatial dynamics of genetic variation that contributes to a rare radiation of trophic specialist pupfish on San Salvador Island, Bahamas.  more » « less
Award ID(s):
1938571 1749764
PAR ID:
10669080
Author(s) / Creator(s):
;
Publisher / Repository:
NCBI
Date Published:
Edition / Version:
PRJNA685538
Format(s):
Medium: X
Location:
NCBI: PRJNA685538
Institution:
University of California, Berkeley
Sponsoring Org:
National Science Foundation
More Like this
  1. (, 2022 International Symposium on Symbolic and Algebraic Computation)
    General Chair: Marc Moreno Chair: Lihong Zhi (Ed.)
    We introduce a new type of reduction in a free difference module over a difference field that uses a generalization of the concept of effective order of a difference polynomial. Then we define the concept of a generalized characteristic set of such a module, establish some properties of these characteristic sets and use them to prove the existence, outline a method of computation and find invariants of a dimension polynomial in two variables associated with a finitely generated difference module. As a consequence of these results, we obtain a new type of bivariate dimension polynomials of finitely generated difference field extensions. We also explain the relationship between these dimension polynomials and the concept of Einstein’s strength of a system of difference equations. 
    more » « less
  2. ; ; (, Proceedings of the ACM on Programming Languages)
    Programmers and researchers are increasingly developing surrogates of programs, models of a subset of the observable behavior of a given program, to solve a variety of software development challenges. Programmers train surrogates from measurements of the behavior of a program on a dataset of input examples. A key challenge of surrogate construction is determining what training data to use to train a surrogate of a given program. We present a methodology for sampling datasets to train neural-network-based surrogates of programs. We first characterize the proportion of data to sample from each region of a program's input space (corresponding to different execution paths of the program) based on the complexity of learning a surrogate of the corresponding execution path. We next provide a program analysis to determine the complexity of different paths in a program. We evaluate these results on a range of real-world programs, demonstrating that complexity-guided sampling results in empirical improvements in accuracy. 
    more » « less
  3. ; (, Journal of Graph Theory)
    ABSTRACT Let be a connected graph. If is a set of vertices of , and is a vertex of , then the distance is the distance between and a vertex of closest to . The eccentricity of is defined as . For , the ‐radius of is defined as the smallest eccentricity of a set of vertices of . The ‐radius is, in some sense, a dual to the ‐distance domination number of , defined as the minimum cardinality of a set of vertices of such that every vertex not in is within distance of some vertex in . We prove that the ‐radius of a 2‐connected graph of order is at most . We also extend the well‐known result that the vertex set of a 2‐connected graph can be partitioned into two subsets of prescribed order, each inducing a connected subgraph. We prove that if we allow a small overlap between the sets, then the vertex set of a 2‐connected graph can be expressed as the union of three subsets of prescribed order, each inducing a connected subgraph. 
    more » « less
  4. ; ; ; ; (, Operations Research)
    The rank of a bimatrix game is the matrix rank of the sum of the two payoff matrices. This paper comprehensively analyzes games of rank one and shows the following: (1) For a game of rank r, the set of its Nash equilibria is the intersection of a generically one-dimensional set of equilibria of parameterized games of rank r − 1 with a hyperplane. (2) One equilibrium of a rank-1 game can be found in polynomial time. (3) All equilibria of a rank-1 game can be found by following a piecewise linear path. In contrast, such a path-following method finds only one equilibrium of a bimatrix game. (4) The number of equilibria of a rank-1 game may be exponential. (5) There is a homeomorphism between the space of bimatrix games and their equilibrium correspondence that preserves rank. It is a variation of the homeomorphism used for the concept of strategic stability of an equilibrium component. 
    more » « less
  5. ; ; ; ; (, International Symposium on Computational Geometry (SoCG))
    We motivate and visualize problems and methods for packing a set of objects into a given container, in particular a set of different-size circles or squares into a square or circular container. Questions of this type have attracted a considerable amount of attention and are known to be notoriously hard. We focus on a particularly simple criterion for deciding whether a set can be packed: comparing the total area A of all objects to the area C of the container. The critical packing density δ∗ is the largest value A/C for which any set of area A can be packed into a container of area C. We describe algorithms that establish the critical density of squares in a square (δ∗ = 0.5), of circles in a square (δ∗ = 0.5390 . . .), regular octagons in a square (δ∗ = 0.5685 . . .), and circles in a circle (δ∗ = 0.5). 2012 ACM Subject Classification Theory of computation → Packing and covering problems; Theory of computation → Computational geometry 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Text Encoded Conversion
  • XML
  • Save / Share this Record
  • Send to Email