wanyu/IteraTeR_v2 huggingface dataset:
Original:  Here, we propose an analytically tractable model for cell size control in microorganisms, under the assumption that noise is additive to the inter-division time, and calculate the distributions of cell sizes and inter-division times .
Revised:  Here, we propose an analytically tractable model for cell size control in microorganisms, under the assumption that noise is additive to the inter-division time, and calculate the cell size and inter-division times .
Edit intent: clarity
Original:  Here, we propose an analytically tractable model for cell size control in microorganisms, under the assumption that noise is additive to the inter-division time, and calculate the distributions of cell sizes and inter-division times .
Revised:  Here, we propose an analytically tractable model for cell size control in microorganisms, under the assumption that noise is additive to the inter-division time, and calculate the distributions of cell sizes and inter-division time distributions .
Edit intent: clarity
Original:  Existing data for E. coli and budding yeast supports partial size control, and a particular explanation: a cell attempts to add a constant volume to its initial one .
Revised:  Existing data for E. coli supports partial size control, and a particular explanation: a cell attempts to add a constant volume to its initial one .
Edit intent: clarity
Original:  In this paper, we attempt to bridge the conceptual gap between these two communities .
Revised:  In this paper, we look at the verification of programs with dynamic data structures from the perspective of content representation .
Edit intent: clarity
Original:  We show how description logic can be used on top of an existing shape analysis to add content descriptions to the shapes.
Edit intent: coherence
Original:  To investigate European population history around the time of the agricultural transition, we sequenced complete genomes from a ~7,500 \sim7 year old early farmer from the Linearbandkeramik (LBK) culture from Stuttgart in Germany and an ~8\sim8 ,000 year old hunter-gatherer from the Loschbour rock shelter in Luxembourg.
Revised:  To investigate European population history around the time of the agricultural transition, we sequenced complete genomes from a \sim7 year old early farmer from the Linearbandkeramik (LBK) culture from Stuttgart in Germany and an ~8\sim8 ,000 year old hunter-gatherer from the Loschbour rock shelter in Luxembourg.
Edit intent: clarity
Original:  To investigate European population history around the time of the agricultural transition, we sequenced complete genomes from a ~7,500 \sim7 year old early farmer from the Linearbandkeramik (LBK) culture from Stuttgart in Germany and an ~8\sim8 ,000 year old hunter-gatherer from the Loschbour rock shelter in Luxembourg.
Revised:  To investigate European population history around the time of the agricultural transition, we sequenced complete genomes from a ~7,500 \sim7,000 year old early farmer from the Linearbandkeramik (LBK) culture from Stuttgart in Germany and an ~8\sim8 ,000 year old hunter-gatherer from the Loschbour rock shelter in Luxembourg.
Edit intent: fluency
Original:  To investigate European population history around the time of the agricultural transition, we sequenced complete genomes from a ~7,500 \sim7 year old early farmer from the Linearbandkeramik (LBK) culture from Stuttgart in Germany and an ~8\sim8 ,000 year old hunter-gatherer from the Loschbour rock shelter in Luxembourg.
Revised:  To investigate European population history around the time of the agricultural transition, we sequenced complete genomes from a ~7,500 \sim7 year old early farmer from Stuttgart in Germany and an ~8\sim8 ,000 year old hunter-gatherer from the Loschbour rock shelter in Luxembourg.
Edit intent: clarity
Original:  To investigate European population history around the time of the agricultural transition, we sequenced complete genomes from a ~7,500 \sim7 year old early farmer from the Linearbandkeramik (LBK) culture from Stuttgart in Germany and an ~8\sim8 ,000 year old hunter-gatherer from the Loschbour rock shelter in Luxembourg.
Revised:  To investigate European population history around the time of the agricultural transition, we sequenced complete genomes from a ~7,500 \sim7 year old early farmer from the Linearbandkeramik (LBK) culture from Stuttgart in Germany , an\sim8 ,000 year old hunter-gatherer from the Loschbour rock shelter in Luxembourg.
Edit intent: fluency
Original:  We compared these genomes and published ancient DNA to new data from 2, 196 samples from 185 diverse populations to show that  at least three ancestral groups contributed to present-day Europeans .
Revised:  We analyzed these data together with other ancient genomes and 2, 196 samples from 185 diverse populations to show that at least three ancestral groups contributed to present-day Europeans .
Edit intent: clarity
Original:  The first are Ancient North Eurasians (ANE), who are more closely related to Upper Paleolithic Siberians than to any present-day population.
Revised:  The first are Ancient North Eurasians (ANE), who were most closely related to Upper Paleolithic Siberians than to any present-day population.
Edit intent: clarity
Original:  The third are Early European Farmers (EEF), related to the Stuttgart individual, who were mainly of Near Eastern origin but also harbored WHG-related ancestry.
Revised:  The third are Early European Farmers (EEF), who were mainly of Near Eastern origin but also harbored WHG-related ancestry.
Edit intent: clarity
Original:  We model the deep relationships of these populations and show that about ~44\% of the ancestry of EEF derived from a basal Eurasian\sim44 lineage that split prior to the separation of other non-Africans .
Revised:  We model these populations' deep relationships and show that about ~44\% of the ancestry of EEF derived from a basal Eurasian\sim44 lineage that split prior to the separation of other non-Africans .
Edit intent: clarity
Original:  We model the deep relationships of these populations and show that about ~44\% of the ancestry of EEF derived from a basal Eurasian\sim44 lineage that split prior to the separation of other non-Africans .
Revised:  We model the deep relationships of these populations and show that EEF had\sim44 lineage that split prior to the separation of other non-Africans .
Edit intent: clarity
Original:  We model the deep relationships of these populations and show that about ~44\% of the ancestry of EEF derived from a basal Eurasian\sim44 lineage that split prior to the separation of other non-Africans .
Revised:  We model the deep relationships of these populations and show that about ~44\% of the ancestry of EEF derived from a basal Eurasian\sim44 lineage that split prior to the diversification of all other non-African lineages .
Edit intent: clarity
Original: A mechanism for transparent GPU-independent checkpoint-restart of 3D graphics is described .
Revised: Providing fault-tolerance for long-running GPU-intensive jobs requires application-specific solutions, and often involves saving the state of complex data structures spread among many graphics libraries. This work describes a mechanism for transparent GPU-independent checkpoint-restart of 3D graphics is described .
Edit intent: coherence
Original: A mechanism for transparent GPU-independent checkpoint-restart of 3D graphics is described .
Revised: A mechanism for transparent GPU-independent checkpoint-restart of 3D graphics .
Edit intent: clarity
Original:  and and the remaining calls are replayed on restart.
Revised:  and the remaining calls are replayed on restart.
Edit intent: fluency
Original: Estimating continuous probability distributions from finite data remains an open problem in statistics .
Revised: The question of how best to estimate continuous probability distributions from finite data remains an open problem in statistics .
Edit intent: clarity
Original: The question of how best to estimate continuous probability distributions from finite data is an intriguing open problem at the interface of statistics and physics.
Revised: The question of how best to estimate a continuous probability density from finite data is an intriguing open problem at the interface of statistics and physics.
Edit intent: clarity
Original:   Here I describe a field-theoretic approach to this problem that, in low dimensions, can be computed rapidly enough to be used in day-to-day data analysis.
Revised:  Here I describe a field-theoretic approach to this problem that, in low dimensions, making it practical for use in day-to-day data analysis.
Edit intent: clarity
Original:  we prove that, in Winfree's abstract Tile Assembly Model, when restricted to use only noncooperative bindings, tile assembly systems that grow exactly one assembly are pumpable, meaning that their production is ultimately periodic in one direction . Non-cooperative tile assembly, also known as temperature 1, is the model where tiles are allowed to bind if they match on at least one side, whereas in cooperative tile assembly, some tiles need to match on several sides in order to bind.
Revised:  we prove that, in Winfree's abstract Tile Assembly Model, when restricted to use only noncooperative bindings, tile assembly systems that grow exactly one assembly are pumpable, meaning that this path can be extended into an infinite, ultimately periodic path . Non-cooperative tile assembly, also known as temperature 1, is the model where tiles are allowed to bind if they match on at least one side, whereas in cooperative tile assembly, some tiles need to match on several sides in order to bind.
Edit intent: clarity
Original: We prove a necessary condition on the computational capabilities of a model of tile assembly that has so far resisted many attempts of formal analysis or programming.
Revised: We prove the computational weakness of a model of tile assembly that has so far resisted many attempts of formal analysis or programming.
Edit intent: clarity
Original:  Specifically, we prove that, in Winfree's abstract Tile Assembly Model, when restricted to use only noncooperative bindings, tile assembly systems that grow a long enough path in all their terminal assemblies are pumpable, meaning that this path can be extended into an infinite, ultimately periodic path.
Revised:  Specifically, we prove that, in Winfree's abstract Tile Assembly Model, when restricted to use only noncooperative bindings, any long enough path in all their terminal assemblies are pumpable, meaning that this path can be extended into an infinite, ultimately periodic path.
Edit intent: clarity
Original:   Non-cooperative tile assembly , also known as temperature 1  , is the model where tiles are allowed to bind if they match on at least one side, whereas in cooperative tile assembly, some tiles need to match on several sides in order to bind.
Revised:  Non-cooperative self-assembly , also known as temperature 1 , is the model where tiles are allowed to bind if they match on at least one side, whereas in cooperative tile assembly, some tiles need to match on several sides in order to bind.
Edit intent: clarity
Original:   Non-cooperative tile assembly , also known as temperature 1  , is the model where tiles are allowed to bind if they match on at least one side, whereas in cooperative tile assembly, some tiles need to match on several sides in order to bind.
Revised:  Non-cooperative tile assembly , also known as temperature 1 tile assembly , is the model where tiles are allowed to bind if they match on at least one side, whereas in cooperative tile assembly, some tiles need to match on several sides in order to bind.
Edit intent: coherence
Original: We prove the computational weakness of a model of tile assembly that has so far resisted many attempts of formal analysis or programming . Specifically, we prove that, in Winfree's abstract Tile Assembly Model, when restricted to use only noncooperative bindings, any long enough path that can grow in all terminal assemblies is pumpable, meaning that this path can be extended into an infinite, ultimately periodic path.
Revised: We prove the computational weakness of a model of tile assembly that has so far resisted many attempts of formal analysis or positive constructions . Specifically, we prove that, in Winfree's abstract Tile Assembly Model, when restricted to use only noncooperative bindings, any long enough path that can grow in all terminal assemblies is pumpable, meaning that this path can be extended into an infinite, ultimately periodic path.
Edit intent: clarity
Original:  Non-cooperative self-assembly, also known as temperature 1 tile assembly, is the model where tiles can bind as soon as one as they match their neighbors on at least one side, whereas in the general model, it can be required that some tiles bind if the match their neighbors on several sides .
Revised:  Non-cooperative self-assembly, also known as temperature 1 tile assembly, is the model where tiles are allowed to bind as soon as one as they match their neighbors on at least one side, whereas in the general model, it can be required that some tiles bind if the match their neighbors on several sides .
Edit intent: clarity
Original:  Non-cooperative self-assembly, also known as temperature 1 tile assembly, is the model where tiles can bind as soon as one as they match their neighbors on at least one side, whereas in the general model, it can be required that some tiles bind if the match their neighbors on several sides .
Revised:  Non-cooperative self-assembly, also known as temperature 1 tile assembly, is the model where tiles can bind as soon as they match on one side, whereas in the general model, it can be required that some tiles bind if the match their neighbors on several sides .
Edit intent: clarity
Original:  Non-cooperative self-assembly, also known as temperature 1 tile assembly, is the model where tiles can bind as soon as one as they match their neighbors on at least one side, whereas in the general model, it can be required that some tiles bind if the match their neighbors on several sides .
Revised:  Non-cooperative self-assembly, also known as temperature 1 tile assembly, is the model where tiles can bind as soon as one as they match their neighbors on at least one side, whereas in cooperative tile assembly, some tiles need to match on several sides .
Edit intent: clarity
Original:  On the word RAM, the algorithm runs in n^3/2^{\Omega(\log n /\log \log n )^{1/2}} + n^{2+o(1)}\log M time for edge weights in ([0,M] \cap {\mathbb Z})\cup\{\infty\}.
Revised:  On the word RAM, the algorithm runs in n^3/2^{\Omega(\log n )^{1/2}} + n^{2+o(1)}\log M time for edge weights in ([0,M] \cap {\mathbb Z})\cup\{\infty\}.
Edit intent: clarity
Original:  We also give a deterministic version of the algorithm running in n^3/2^{\log^{\delta} n} time for some \delta > 0, which utilizes the Yao-Beigel-Tarui translation of {\sf AC}^0[m] circuits into ``nice'' depth-two circuits.
Revised:  We also give a deterministic version of the algorithm running in n^3/2^{\log^{\delta} n} time for some \delta > 0, which utilizes the Yao-Beigel-Tarui translation of {\sf AC}^0[m] circuits into "nice" depth-two circuits.
Edit intent: fluency
Original:  Practically , the crystallization process mainly proceeds through knowledge-informed empiricism.
Revised:  In practice , the crystallization process mainly proceeds through knowledge-informed empiricism.
Edit intent: fluency
Original:  Practically , the crystallization process mainly proceeds through knowledge-informed empiricism.
Revised:  Practically , the crystallization process proceeds through knowledge-informed empiricism.
Edit intent: clarity
Original:  Better physico-chemical assistance remains elusive because of the large number of variables involved ;
Revised:  Better physico-chemical understanding remains elusive because of the large number of variables involved ;
Edit intent: clarity
Original:  To help determine relationships between macromolecular properties and their crystallization propensity, we train statistical models on samples for 182 proteins supplied by the Northeast Structural Genomics Consortium.
Revised:  To help determine relationships between macromolecular properties and their crystallization propensity, we have trained statistical models on samples for 182 proteins supplied by the Northeast Structural Genomics Consortium.
Edit intent: style
Original:  Gaussian Processes , which capture trends beyond the reach of linear statistical models, help us distinguish between two main physico-chemical mechanisms driving crystallization.
Revised:  Gaussian Processes , which capture trends beyond the reach of linear statistical models, distinguish between two main physico-chemical mechanisms driving crystallization.
Edit intent: coherence
Original:  One is characterized by low levels of side chain entropy and is extensively reported in the literature.
Revised:  One is characterized by low levels of side chain entropy and has been extensively reported in the literature.
Edit intent: clarity
Original:  The other identifies specific electrostatic interactions , not previously described in the crystallization context.
Revised:  The other identifies specific electrostatic interactions not previously described in the crystallization context.
Edit intent: fluency
Original:  The availability of crystallization data coupled with structural outcomes analyzed through complex statistical models will guide macromolecular crystallization toward a more rational basis.
Revised:  The availability of crystallization data coupled with structural outcomes analyzed through state-of-the-art statistical models may thus guide macromolecular crystallization toward a more rational basis.
Edit intent: clarity
Original:  For instance, the Bisection problem asks for a partition of the vertices into two equal-sized parts , so that at most k edges connect them.
Revised:  For instance, the Bisection problem asks to remove at most k edges in order to partition the vertices into two equal-sized parts , so that at most k edges connect them.
Edit intent: clarity
Original:  In fact, this holds for all parameters polynomial in the input size that do not increase when taking disjoint unions of graphs.
Edit intent: coherence
Original:  We show that this more general problem is FPT w.r.t. the number of removed vertices k , if the solution cuts the graph into a constant number c of connected components.
Revised:  We show that this problem is FPT w.r.t. the number of removed vertices k , if the solution cuts the graph into a constant number c of connected components.
Edit intent: clarity
Original:  We show that this more general problem is FPT w.r.t. the number of removed vertices k , if the solution cuts the graph into a constant number c of connected components.
Revised:  We show that this more general problem is FPT for the number of removed vertices k , if the solution cuts the graph into a constant number c of connected components.
Edit intent: clarity
Original:  We show that this more general problem is FPT w.r.t. the number of removed vertices k , if the solution cuts the graph into a constant number c of connected components.
Revised:  We show that this more general problem is FPT w.r.t. the number of removed vertices k if the solution cuts the graph into a constant number c of connected components.
Edit intent: fluency
Original:  Assuming constant c is unavoidable, since we also prove that Vertex Bisection is W[1]-hard w.r.t. (k,c).
Revised:  The latter condition is unavoidable, since we also prove that Vertex Bisection is W[1]-hard w.r.t. (k,c).
Edit intent: clarity
Original:  The adaptation entails additional running time factors of n ^(O(d)) . We show that a substantial speed-up is unlikely since the corresponding task is W[1]-hard w.r.t. d, even on forests of maximum degree two.
Revised:  The adaptation entails additional running time factors of n ^{O(d) . We show that a substantial speed-up is unlikely since the corresponding task is W[1]-hard w.r.t. d, even on forests of maximum degree two.
Edit intent: fluency
Original:  We can, however, show that it is FPT w.r.t. the vertex cover number.
Revised:  We can, however, show that it is FPT for the vertex cover number.
Edit intent: clarity
Original:  It is shown that the presented seeding method enables automated hyperstreamline-based visualization of a broad range of alignment tensor fields which significantly enhances the ability of researchers to interpret these fields and provides an alternative to using glyph-based techniques.
Revised:  It is shown that the presented seeding method enables automated hyperstreamline-based visualization of a broad range of alignment tensor fields which enhances the ability of researchers to interpret these fields and provides an alternative to using glyph-based techniques.
Edit intent: clarity
Original: The determination of whether a gene is protein coding or not is a key goal of genome annotation projects.
Revised: Determining the full complement of protein-coding genes is a key goal of genome annotation projects.
Edit intent: clarity
Original:  Here we map the peptides detected in 7 large-scale proteomics studies to the GENCODE v12 annotation of the human genome and identify almost 60\% of the protein coding genes  .
Revised:  Here we map the peptides detected in 7 large-scale proteomics studies to almost 60\% of the protein coding genes .
Edit intent: clarity
Original:  At the same time there is little or no evidence for protein expression for genes that have appeared since primates or that do not have any protein-like features or conservation.
Revised:  At the same time there is little or no evidence of protein expression for genes that have appeared since primates or that do not have any protein-like features or conservation.
Edit intent: fluency
Original:  At the same time there is little or no evidence for protein expression for genes that have appeared since primates or that do not have any protein-like features or conservation.
Revised:  At the same time there is little or no evidence for protein expression for genes that have appeared since primates , or genes that do not have any protein-like features or conservation.
Edit intent: fluency
Original:  We suggest that many of the genes that lack supporting evidence and that are not detected in proteomics experiments, do not code for proteins under normal circumstances and that they should not be included in the human protein coding gene catalogue.
Revised:  We suggest that many of these 2,001 genes do not code for proteins under normal circumstances and that they should not be included in the human protein coding gene catalogue.
Edit intent: clarity
Original:  We find  the age of the gene family and its conservation across vertebrate species are key indicators of whether a peptide will be detected in proteomics experiments.
Revised:  We find that conservation across vertebrate species and the age of the gene family and its conservation across vertebrate species are key indicators of whether a peptide will be detected in proteomics experiments.
Edit intent: fluency
Original:  We find  the age of the gene family and its conservation across vertebrate species are key indicators of whether a peptide will be detected in proteomics experiments.
Revised:  We find the age of the gene family are key indicators of whether a peptide will be detected in proteomics experiments.
Edit intent: clarity
Original:  At the same time there is little or no evidence of protein expression for novel genes , those that have appeared since primates, or  genes that do not have any protein-like features or cross-species conservation.
Revised:  At the same time there is little or no evidence of protein expression for genes that have appeared since primates, or genes that do not have any protein-like features or cross-species conservation.
Edit intent: clarity