Fusion genes formed by chromosomal rearrangements are common drivers of cancer. Recent innovations in the field of next‐generation sequencing (NGS) have seen a dynamic shift from traditional fusion detection approaches, such as visual characterization by fluorescence, to more precise multiplexed methods. There are many different NGS‐based approaches to fusion gene detection and deciding on the most appropriate method can be difficult. Beyond the experimental approach, consideration needs to be given to factors such as the ease of implementation, processing time, (...) associated costs, and the level of expertise required for data analysis. Here, the different NGS‐based methods for fusion gene detection, the basic principles underlying the techniques, and the benefits and limitations of each approach are reviewed. This article concludes with a discussion of how NGS will impact fusion gene detection in a clinical context and from where the next innovations are evolving. (shrink)

Studies of Y chromosome evolution often emphasize gene loss, but this loss has been counterbalanced by addition of new genes. The DAZ genes, which are critical to human spermatogenesis, were acquired by the Y chromosome in the ancestor of Old World monkeys and apes. We and our colleagues recently sequenced the rhesus macaque Y chromosome, and comparison of this sequence to human and chimpanzee enables us to reconstruct much of the evolutionary history of DAZ. We report that DAZ arrived on (...) the Y chromosome about 38 million years ago via the transposition of at least 1.1 megabases of autosomal DNA. This transposition also brought five additional genes to the Y chromosome, but all five genes were subsequently lost through mutation or deletion. As the only surviving gene, DAZ experienced extensive restructuring, including intragenic amplification and gene duplication, and has been the target of positive selection in the chimpanzee lineage.Editor's suggested further reading in BioEssays Should Y stay or should Y go: The evolution of non‐recombining sex chromosomes Abstract. (shrink)

American Academy of Pediatrics (AAP) and American College of Medical Genetics (ACMG) recently provided two recommendations about predictive genetic testing of children. The Clinical Sequencing Exploratory Research Consortium's Pediatrics Working Group compared these recommendations, focusing on operational and ethical issues specific to decision making for children. Content analysis of the statements addresses two issues: (1) how these recommendations characterize and analyze locus of decision making, as well as the risks and benefits of testing, and (2) whether the guidelines conflict (...) or come to different but compatible conclusions because they consider different testing scenarios. These statements differ in ethically significant ways. AAP/ACMG analyzes risks and benefits using best interests of the child and recommends that, absent ameliorative interventions available during childhood, clinicians should generally decline to order testing. Parents authorize focused tests. ACMG analyzes risks and benefits using the interests of the child and other family members and recommends that sequencing results be examined for additional variants that can lead to ameliorative interventions, regardless of age, which laboratories should report to clinicians who should contextualize the results. Parents must accept additional analysis. The ethical arguments in these statements appear to be in tension with each other. (shrink)

Recent years have witnessed an explosion of the single-cell biochemical toolbox including chromosome conformation capture -based methods that provide novel insights into chromatin spatial organization in individual cells. The observations made with these techniques revealed that topologically associating domains emerge from cell population averages and do not exist as static structures in individual cells. Stochastic nature of the genome folding is likely to be biologically relevant and may reflect the ability of chromatin fibers to adopt a number of alternative configurations, (...) some of which could be transiently stabilized and serve regulatory purposes. Single-cell Hi-C approaches provide an opportunity to analyze chromatin folding in rare cell types such as stem cells, tumor progenitors, oocytes, and totipotent cells, contributing to a deeper understanding of basic mechanisms in development and disease. Here, we review key findings of single-cell Hi-C and discuss possible biological reasons and consequences of the inferred dynamic chromatin spatial organization. Single-cell Hi-C expands the molecular biology toolbox for studies of chromatin structure in individual cells. This technique allows one to analyze cell-to-cell variability in TAD and loop structure, and to capture chromosome conformation in rare cell types such as oocytes, totipotent cells, and tumor progenitors. (shrink)

Recent years have witnessed an explosion of the single-cell biochemical toolbox including chromosome conformation capture -based methods that provide novel insights into chromatin spatial organization in individual cells. The observations made with these techniques revealed that topologically associating domains emerge from cell population averages and do not exist as static structures in individual cells. Stochastic nature of the genome folding is likely to be biologically relevant and may reflect the ability of chromatin fibers to adopt a number of alternative configurations, (...) some of which could be transiently stabilized and serve regulatory purposes. Single-cell Hi-C approaches provide an opportunity to analyze chromatin folding in rare cell types such as stem cells, tumor progenitors, oocytes, and totipotent cells, contributing to a deeper understanding of basic mechanisms in development and disease. Here, we review key findings of single-cell Hi-C and discuss possible biological reasons and consequences of the inferred dynamic chromatin spatial organization. Single-cell Hi-C expands the molecular biology toolbox for studies of chromatin structure in individual cells. This technique allows one to analyze cell-to-cell variability in TAD and loop structure, and to capture chromosome conformation in rare cell types such as oocytes, totipotent cells, and tumor progenitors. (shrink)

In 2013, the U.S. National Institutes of Health funded four large interdisciplinary research projects exploring the “implications, challenges and opportunities associated with the possible use of g...

We define DNA sequence by a bottom-up approach, starting with a real sequence from an actual biological sample. By providing axioms for notions of string, substring and strand, we formally define a DNA sequence, and a DNA molecule as composed of two antiparallel strands. We note that a sequence is a kind of group in which each member stands a certain relation to every other. The spatial aspects of a DNA sequence are also described.

The aim of this paper is to highlight an interdependence between procedural and agential norms that undermines their neat separation when appraising argumentation. Drawing on the munāẓara tradition, we carve a space for sequencing in argumentation scholarship. Focusing on the antagonist’s sequencing of critical moves, we identify each sequence’s corresponding values of argumentation: coalescence, reliability, and efficacy. These values arise through the mediation of virtues and simultaneously underpin procedural as well as agential norms. Consequently, an ambiguity between procedure (...) and agent becomes apparent. This ambiguity hints at the potential for a virtue theory of argumentation that draws on procedural norms. (shrink)

I compare several types of knowledge-based and knowledge-poor approaches to anaphora and ellipsis resolution. The former are able to capture fine-grained distinctions that depend on lexical meaning and real world knowledge, but they are generally not robust. The latter show considerable promise for yielding wide coverage systems. However, they consistently miss a small but significant subset of cases that are not accessible to rough-grained techniques of intepretation. I propose a sequenced model which first applies the most computationally efficient and inexpensive (...) methods to resolution and then progresses successively to more costly techniques to deal with cases not handled by previous modules. Confidence measures evaluate the judgements of each component in order to determine which instances of anaphora or ellipsis are to be passed on to the next, more fine-grained subsystem. (shrink)

ABSTRACT The apparent consistency of Sobel sequences famously motivated David Lewis to defend a variably strict conditional semantics for counterfactuals. If Sophie had gone to the parade, she would have seen Pedro. If Sophie had gone to the parade and had been stuck behind someone tall, she would not have seen Pedro. But if the order of the counterfactuals in a Sobel sequence is reversed—in the example, if is asserted prior to —the second counterfactual asserted no longer rings true. This (...) is the Heim sequence problem. That the order of assertion makes this difference is surprising on the variably strict account. Some argue that this is reason to reject the Lewis-Stalnaker semantics outright. Others argue that the problem motivates a contextualist rendering of counterfactuals. Still others maintain that the explanation for the phenomenon is merely pragmatic. I argue that none of these is right, and I defend a novel way to understand the phenomenon. My proposal avoids the problems faced by the alternative analyses and enjoys independent support. There is, however, a difficulty for my view: it entails that many ordinarily accepted counterfactuals are not true. I argue that this cost is acceptable. (shrink)

This paper sketches a way of supplementing classical mathematics with a motivation for a Brouwerian theory of free choice sequences. The idea is that time is unending, i.e. that one can never come to an end of it, but also indeterminate, so that in a branching time model only one branch represents the ‘actual’ one. The branching can be random or subject to various restrictions imposed by the creating subject. The fact that the underlying mathematics is classical makes such perhaps (...) delicate issues as the fan theorem no longer problematic. On this model, only intuitionistic logic applies to the Brouwerian free choice sequences, and there it applies not because of any skepticism about classical mathematics, but because there is no ‘end of time’ from the standpoint of which everything about the sequences can be decided. (shrink)

Specker sequences are constructive, increasing, bounded sequences of rationals that do not converge to any constructive real. A sequence is said to be a strong Specker sequence if it is Specker and eventually bounded away from every constructive real. Within Bishop's constructive mathematics we investigate non-decreasing, bounded sequences of rationals that eventually avoid sets that are unions of sequences of intervals with rational endpoints. This yields surprisingly straightforward proofs of certain basic results fromconstructive mathematics. Within Russian constructivism, we show how (...) to use this general method to generate Specker sequences. Furthermore, we show that any nonvoid subset of the constructive reals that has no isolated points contains a strictly increasing sequence that is eventually bounded away from every constructive real. If every neighborhood of every point in the subset contains a rational number different from that point, the subset contains a strong Specker sequence. (shrink)

Running head: Implicit sequence learning ABSTRACT Can we learn without awareness? Although this issue has been extensively explored through studies of implicit learning, there is currently no agreement about the extent to which knowledge can be acquired and projected onto performance in an unconscious way. The controversy, like that surrounding implicit memory, seems to be at least in part attributable to unquestioned acceptance of the unrealistic assumption that tasks are process-pure, that is, that a given task exclusively involves either implicit (...) or explicit knowledge. (shrink)

As linguistic competence so clearly illustrates, processing sequences of events is a fundamental aspect of human cognition. For this reason perhaps, sequence learning behavior currently attracts considerable attention in both cognitive psychology and computational theory. In typical sequence learning situations, participants are asked to react to each element of sequentially structured visual sequences of events. An important issue in this context is to determine whether essentially associative processes are sufficient to understand human performance, or whether more powerful learning mechanisms are (...) necessary. To address this issue, we explore how well human participants and connectionist models are capable of learning sequential material that involves complex, disjoint, longdistance contingencies. We show that the popular Simple Recurrent Network model (Elman, 1990), which has otherwise been shown to account for a variety of empirical findings (Cleeremans, 1993), fails to account for human performance in several experimental situations meant to test the model’s specific predictions. In previous research (Cleeremans, 1993) briefly described in this paper, the structure of center-embedded sequential structures was manipulated to be strictly identical or probabilistically different as a function of the elements surrounding the embedding. While the SRN could only learn in the second case, human subjects were found to be insensitive to the manipulation. In the new experiment described in this paper, we tested the idea that performance benefits from “starting small effects” (Elman, 1993) by contrasting two conditions in which the training regimen was either incremental or not. Again, while the SRN is only capable of learning in the first case, human subjects were able to learn in both. We suggest an alternative model based on Maskara & Noetzel’s (1991) Auto-Associative Recurrent Network as a way to overcome the SRN model’s failure to account for the empirical findings.. (shrink)

A model of gestural sequencing in speech is proposed that aspires to producing biologically plausible fluent and efficient movement in generating an utterance. We have previously proposed a modification of the well-known task dynamic implementation of articulatory phonology such that any given articulatory movement can be associated with a quantification of effort (Simko & Cummins, 2010). To this we add a quantitative cost that decreases as speech gestures become more precise, and hence intelligible, and a third cost component that (...) places a premium on the duration of an utterance. Together, these three cost elements allow us to derive algorithmically optimal sequences of gestures and dynamical parameters for generating articulator movement. We show that the optimized movement displays many timing characteristics that are representative of real speech movement, capturing subtle details of relative timing between gestures. Optimal movement sequences also display invariances in timing that suggest syllable-level coordination for CV sequences. We explore the behavior of the model as prosodic context is manipulated in two dimensions: clarity of articulation and speech rate. Smooth, fluid, and efficient movements result. (shrink)

This paper uses the Process Dissociation Procedure to explore whether people can acquire unconscious knowledge in the serial reaction time task [Destrebecqz, A., & Cleeremans, A. . Can sequence learning be implicit? New evidence with the Process Dissociation Procedure. Psychonomic Bulletin & Review, 8, 343–350; Wilkinson, L., & Shanks, D. R. . Intentional control and implicit sequence learning. Journal of Experimental Psychology: Learning, Memory, and Cognition, 30, 354–369]. Experiment 1 showed that people generated legal sequences above baseline levels under exclusion (...) instructions. Reward moved exclusion performance towards baseline, indicating that the extent of motivation in the test phase influenced the expression of unconscious knowledge. Experiments 2 and 3 revealed that even with reward, adding noise to the sequences or shortening training led to above-baseline exclusion performance, suggesting that task difficulty and the amount of training also affected the expression of unconscious knowledge. The results help resolve some current debates about the role of conscious awareness in sequence learning. (shrink)

Sequences play a great role in mathematical communication. In mathematical notation, we use sequence ellipsis (. . . ) to denote "obvious" sequences like 1, 2, . . . , 7, and in conceptualizations sequence constructors like (i 2+1) i∈N. Furthermore, sequences have a prominent role as argument sequences of flexary functions. While the former cases can adequately be represented and reasoned about as domain objects in Open- Math and MathML, argument sequences are at the language level, and can only (...) be represented, but not reasoned with, since the necessary (sequence-schematic) axioms cannot be represented in the language. (shrink)

Human language is a salient example of a neurocognitive system that is specialized to process complex dependencies between sensory events distributed in time, yet how this system evolved and specialized remains unclear. Artificial Grammar Learning (AGL) studies have generated a wealth of insights into how human adults and infants process different types of sequencing dependencies of varying complexity. The AGL paradigm has also been adopted to examine the sequence processing abilities of nonhuman animals. We critically evaluate this growing literature (...) in species ranging from mammals (primates and rats) to birds (pigeons, songbirds, and parrots) considering also cross‐species comparisons. The findings are contrasted with seminal studies in human infants that motivated the work in nonhuman animals. This synopsis identifies advances in knowledge and where uncertainty remains regarding the various strategies that nonhuman animals can adopt for processing sequencing dependencies. The paucity of evidence in the few species studied to date and the need for follow‐up experiments indicate that we do not yet understand the limits of animal sequence processing capacities and thereby the evolutionary pattern. This vibrant, yet still budding, field of research carries substantial promise for advancing knowledge on animal abilities, cognitive substrates, and language evolution. (shrink)

ABSTRACT There are two tenets about free agency that have proven difficult to combine: free agency is grounded in an agent’s possession or exercise of their reasons-responsiveness, only actual sequence features can ground free agency. This paper argues that and can only be reconciled if we recognise that their clash is just the particular manifestation of a wider conflict between two approaches to the notion of non-accidentality. According to modalism, p is non-accidentally connected to q iff p modally tracks q. (...) According to explanationism, p is non-accidentally connected to q iff q explains p in the right way. The conflict between these two approaches becomes manifest in Frankfurt-like cases for many notions, in which p and q are intuitively non-accidentally connected even though there is no modal tracking between them. Thus, and can’t be combined because the Frankfurt-cases upon which rests track explanationist intuitions, while the non-accidentality requirement of reasons-responsiveness in is usually spelled out in modalist terms. Hence, the possibility of an actual sequence reasons-responsiveness account depends on finding an explanationist approach to the non-accidentality requirement of reasons-responsiveness. (shrink)

Can the straight line be analysed mathematically such that it does not fall apart into a set of discrete points, as is usually done but through which its fundamental continuity is lost? And are there objects of pure mathematics that can change through time? Mathematician and philosopher L.E.J. Brouwer argued that the two questions are closely related and that the answer to both is "yes''. To this end he introduced a new kind of object into mathematics, the choice sequence. But (...) other mathematicians and philosophers have been voicing objections to choice sequences from the start. This book aims to provide a sound philosophical basis for Brouwer's choice sequences by subjecting them to a phenomenological critique in the style of the later Husserl. (shrink)

This title introduces the concepts of algorithms and sequencing in coding by using relatable real-world examples in the reader's everyday life. Vivid photographs and easy-to-read text aid comprehension for early readers. Features include a table of contents, an infographic, fun facts, Making Connections questions, a glossary, and an index. QR Codes in the book give readers access to book-specific resources to further their learning. Aligned to Common Core Standards and correlated to state standards. Cody Koala is an imprint of (...) Pop!, a division of ABDO. (shrink)

We prove several results giving lower bounds for the large cardinal strength of a failure of the singular cardinal hypothesis. The main result is the following theorem: Theorem. Suppose κ is a singular strong limit cardinal and 2κ λ where λ is not the successor of a cardinal of cofinality at most κ. If cf > ω then it follows that o λ, and if cf = ωthen either o λ or {α: K o α+n} is confinal in κ for (...) each n ε ω.We also prove several results which extend or are related to this result, notably Theorem. If 2ω ω1 then there is a sharp for a model with a strong cardinal.In order to prove these theorems we give a detailed analysis of the sequences of indiscernibles which come from applying the covering lemma to nonoverlapping sequences of extenders. (shrink)

Versions of Laver sequences are known to exist for supercompact and strong cardinals. Assuming very strong axioms of infinity, Laver sequences can be constructed for virtually any globally defined large cardinal not weaker than a strong cardinal; indeed, under strong hypotheses, Laver sequences can be constructed for virtually any regular class of embeddings. We show here that if there is a regular class of embeddings with critical point κ, and there is an inaccessible above κ, then it is consistent for (...) there to be a regular class that admits no Laver sequence. We also show that extendible cardinals are Laver-generating, i.e., that assuming only that κ is extendible, there is an extendible Laver sequence at κ. We use the method of proof to answer a question about Laver-closure of extendible cardinals at inaccessibles. Finally, we consider Laver sequences for super-almost-huge cardinals. Assuming slightly more than super-almost-hugeness, we show that there are super-almost-huge Laver sequences, improving the previously known upper bound for such Laver sequences. We also describe conditions under which the canonical construction of a Laver sequence fails for super-almost-huge cardinals. (shrink)

We investigate maximal free sequences in the Boolean algebra \ {/}\text {fin}\), as defined by Monk :593–610, 2011). We provide some information on the general structure of these objects and we are particularly interested in the minimal cardinality of a free sequence, a cardinal characteristic of the continuum denoted \. Answering a question of Monk, we demonstrate the consistency of \. In fact, this consistency is demonstrated in the model of Shelah for \ :433–443, 1992). Our paper provides a streamlined (...) and mostly self contained presentation of this construction. (shrink)

We investigate maximal free sequences in the Boolean algebra \ {/}\text {fin}\), as defined by Monk :593–610, 2011). We provide some information on the general structure of these objects and we are particularly interested in the minimal cardinality of a free sequence, a cardinal characteristic of the continuum denoted \. Answering a question of Monk, we demonstrate the consistency of \. In fact, this consistency is demonstrated in the model of Shelah for \ :433–443, 1992). Our paper provides a streamlined (...) and mostly self contained presentation of this construction. (shrink)

We investigate maximal free sequences in the Boolean algebra \ {/}\text {fin}\), as defined by Monk :593–610, 2011). We provide some information on the general structure of these objects and we are particularly interested in the minimal cardinality of a free sequence, a cardinal characteristic of the continuum denoted \. Answering a question of Monk, we demonstrate the consistency of \. In fact, this consistency is demonstrated in the model of Shelah for \ :433–443, 1992). Our paper provides a streamlined (...) and mostly self contained presentation of this construction. (shrink)

In recent years, some scholars have claimed that humans are unique in their capacity and motivation to engage in cooperative communication and extensive, fast-paced social interactions. While research on gestural communication in great apes has offered important findings concerning the gestural repertoires of different species, very little is known about the sequential organization of primates’ communicative behavior during interactions. Drawing on a conversation analytic framework, this paper addresses this gap by investigating the sequential organization of bonobo mother-infant interactions, and more (...) specifically, how individuals solicit carries from one another. It shows how bonobos establish participation frameworks before producing a carry request gesture and how the ensuing communicative actions can be organized in adjacency-pair sequences. Moreover, the timing between the initiation of an action and its response is similar to what has been documented in adult human interaction. Finally, it outlines some of the orderly practices bonobos use to deal with the absence of response from the addressed participants in carry sequences. Keywords: adjacency pair; pan paniscus; conversation analysis; gestures; interactional time; sequence organization. (shrink)

In recent years, some scholars have claimed that humans are unique in their capacity and motivation to engage in cooperative communication and extensive, fast-paced social interactions. While research on gestural communication in great apes has offered important findings concerning the gestural repertoires of different species, very little is known about the sequential organization of primates’ communicative behavior during interactions. Drawing on a conversation analytic framework, this paper addresses this gap by investigating the sequential organization of bonobo mother-infant interactions, and more (...) specifically, how individuals solicit carries from one another. It shows how bonobos establish participation frameworks before producing a carry request gesture and how the ensuing communicative actions can be organized in adjacency-pair sequences. Moreover, the timing between the initiation of an action and its response is similar to what has been documented in adult human interaction. Finally, it outlines some of the orderly practices bonobos use to deal with the absence of response from the addressed participants in carry sequences. Keywords: adjacency pair; pan paniscus ; conversation analysis; gestures; interactional time; sequence organization. (shrink)

Over the past decade, sequence learning has gradually become a central paradigm through which to study implicit learning. In this chapter, we start by briefly summarizing the results obtained with different variants of the sequence learning paradigm. We distinguish three subparadigms in terms of whether the stimulus material is generated either by following a fixed and repeating sequence (e.g., Nissen & Bullemer, 1987), by relying on a complex set of rules from which one can produce several alternative deterministic sequences (e.g., (...) Lewicki, Hill & Bizot, 1988; Stadler, 1989), or by following the output of a probabilistic set of rules such as instantiated by noisy finite-state grammars (Cleeremans & McClelland, 1991; Jiménez, Mendéz & Cleeremans, 1996). Next, we focus on the processes involved in sequence representation and acquisition. We suggest that the sensitivity to the sequential structure observed in the probabilistic subparadigm can only be a result of the acquisition of a representation of the statistical constraints of the material, and that this sensitivity emerges through the operation of mechanisms that are well instantiated by connectionist models such as the Simple Recurrent Network (Elman, 1990; Cleeremans, 1993b). We present new simulation work meant to explore to what extent the model can also account for specific data obtained in a paradigmatic instance of deterministic, rule-based sequence learning task: Lewicki et al. (1988)'s situation. Finally, we report on the results of an experiment that compares learning on otherwise similar deterministic and probabilistic structures, and we show that learning of both types of structures is equivalent only under conditions that maximally hinder explicit acquisition. Taken together, these simulation and experimental data lend support to the claim that implicit learning in all three sequence learning subparadigms can amount to a form of statistical sequence learning. They also suggest that distinguishing among several theories of sequence representation and acquisition may require us to analize the data in great detail. Hopefully, however, some truth can be found in such details.. (shrink)

"Cover"--"Title" -- "Copyright" -- "Dedication" -- "Contents" -- "List of Figures" -- "Acknowledgements" -- "1 Introduction" -- "Limina" -- "Anticipation and Recapitulation" -- "Problems of Cinematic Paratext" -- "2 Narrative Exposition" -- "Pseudo-independence" -- "Intratextuality" -- "3 Expositional Modes" -- "The Allegory Mode" -- "Lexical Expertise" -- "4 The Comment Mode" -- "Narrative Futurity" -- "Intertextuality and Quotation" -- "5 The Summary Mode" -- "Complex Summary" -- "Narrative Restatement" -- "6 The Prologue Mode" -- "Realist Integration" -- "Expository Texts" -- (...) "7 Conclusions" -- "The Paradoxes of Cinematic Paratext" -- "Typography and Pseudo-independence" -- "The Ideology of Naturalism::Stylization. (shrink)

Five recursively axiomatizable theories extending Kleene's intuitionistic theory FIM of numbers and numbertheoretic sequences are introduced and shown to be consistent, by a modified relative realizability interpretation which verifies that every sequence classically defined by a Π11 formula is unavoidable and that no sequence can fail to be classically Δ11. The analytical form of Markov's Principle fails under the interpretation. The notion of strongly inadmissible rule of inference is introduced, with examples.

Sibley, Kello, Plaut, and Elman (2008) proposed the sequence encoder as a model that learns fixed‐width distributed representations of variable‐length sequences. In doing so, the sequence encoder overcomes problems that have restricted models of word reading and recognition to processing only monosyllabic words. Bowers and Davis (2009) recently claimed that the sequence encoder does not actually overcome the relevant problems, and hence it is not a useful component of large‐scale word‐reading models. In this reply, it is noted that the sequence (...) encoder has facilitated the creation of large‐scale word‐reading models. The reasons for this success are explained and stand as counterarguments to claims made by Bowers and Davis. (shrink)

For given Boolean algebras$\mathbb {A}$and$\mathbb {B}$we endow the space$\mathcal {H}(\mathbb {A},\mathbb {B})$of all Boolean homomorphisms from$\mathbb {A}$to$\mathbb {B}$with various topologies and study convergence properties of sequences in$\mathcal {H}(\mathbb {A},\mathbb {B})$. We are in particular interested in the situation when$\mathbb {B}$is a measure algebra as in this case we obtain a natural tool for studying topological convergence properties of sequences of ultrafilters on$\mathbb {A}$in random extensions of the set-theoretical universe. This appears to have strong connections with Dow and Fremlin’s result stating (...) that there are Efimov spaces in the random model. We also investigate relations between topologies on$\mathcal {H}(\mathbb {A},\mathbb {B})$for a Boolean algebra$\mathbb {B}$carrying a strictly positive measure and convergence properties of sequences of measures on$\mathbb {A}$. (shrink)