Results 41 to 50 of about 28,982 (257)

Individual sequences in large sets of gene sequences may be distinguished efficiently by combinations of shared sub-sequences-1

, 2011
Copyright information:Taken from "Individual sequences in large sets of gene sequences may be distinguished efficiently by combinations of shared sub-sequences"BMC Bioinformatics 2005;6():90-90.Published online 8 Apr 2005PMCID:PMC1090557.Copyright © 2005
Mark J Gibbs (58361), Adrian J Gibbs (58363), John S Armstrong (58362)   +2 more
core   +1 more source

Quasi-Almost Lacunary Statistical Convergence of Sequences of Sets

International Journal of Analysis and Applications, 2018
In this study, we defined concepts of Wijsman quasi-almost lacunary convergence, Wijsman quasi-strongly almost lacunary convergence and Wijsman quasi q-strongly almost lacunary convergence.
Esra Gulle, Ugur Ulusu
doaj   +2 more sources

Characterizations of compact operators on ℓp−type fractional sets of sequences

Demonstratio Mathematica, 2019
Among the sets of sequences studied, difference sets of sequences are probably the most common type of sets. This paper considers some ℓp−type fractional difference sets via the gamma function.
Özger Faruk
doaj   +1 more source

Density by moduli and Wijsman lacunary statistical convergence of sequences of sets

Journal of Inequalities and Applications, 2017
The main object of this paper is to introduce and study a new concept of f-Wijsman lacunary statistical convergence of sequences of sets, where f is an unbounded modulus.
Vinod K Bhardwaj, Shweta Dhawan
doaj   +1 more source

Design Framework of Fourier-Based Non-Orthogonal Sequences for Sparse Activity Detection in Multicell Massive Connectivity

IEEE Access, 2022
In massive machine-type communications (mMTC), grant-free access is a key enabler for a massive number of users to be connected to a base station with low signaling overhead and low latency. In this paper, new Fourier-based sequence sets are proposed for
Nam Yul Yu
doaj   +1 more source

Computation sequence sets

Journal of Computer and System Sciences, 1976
A class of automata based upon generalized Petri nets is introduced and defined. The language which a Petri net generates during an execution is called a computation sequence set (CSS). The class of CSS languages is shown to be closed under union, intersection, concatenation, and concurrency. All regular languages and all bounded context-free languages
openaire   +2 more sources

Checking sequence construction using adaptive and preset distinguishing sequences

, 2009
Methods for testing from finite state machine-based specifications often require the existence of a preset distinguishing sequence for constructing checking sequences.
Husnu Yenigun, Jourdan, Guy-Vincent, Yenigun, H, Yenigün, Hüsnü, Robert M. Hierons, Guy-Vincent Jourdan, Hasan Ural, Hierons, Robert M., Ural, Hasan, Jourdan, GV, Hierons, RM, Ural, H   +11 more
core   +1 more source

Deep Sequencing of FLT3‐ITD Enables Response Evaluation and Post‐Treatment Monitoring in Childhood AML: An Exploratory Study

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Background An internal tandem duplication in the gene encoding Fms‐like tyrosine kinase 3 (FLT3‐ITD) is associated with high relapse risk and poor prognosis in acute myeloid leukemia (AML) and plays a crucial role in treatment decisions. Measurable residual disease (MRD) analysis of FLT3‐ITD during and after treatment has shown prognostic ...
Sofie Johansson Alm, Bea Tornberg, Erik Delsing Malmberg, Henrik Hasle, Kristian Løvvik Juul‐Dam, Lars Palmqvist, Borhan R. Saeed, Giti Shah Barkhordar, Anastasia Soboli, Anna Staffas, Jonas Abrahamsson, Linda Fogelstrand   +11 more
wiley   +1 more source

Partitions of the set of finite sequences

Journal of Combinatorial Theory, Series A, 1995
The authors study the collection \(C\) of all infinite cardinals \(\kappa\) with the property that for every \(F : \bigcup_{n \in \omega} {}^n\kappa \to 2\), there are \(H_i \subseteq \kappa\) for \(i \in \omega\) such that (a) \(|H_i|= 2\) for each \(i \in \omega\), and (b) \(F\) is constant on \(\prod^n_{i = 0} H_i\) for every \(n \in \omega\). It is
María Carrasco, Carlos A. Di Prisco, Andrés Millán   +2 more
openaire   +2 more sources

Efficacy and Safety Analysis of Roxarestat in Regulating Renal Anemia in Patients on Maintenance Hemodialysis

Therapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Objective To compare the efficacy and safety of roxarestat versus recombinant human erythropoietin (rhEPO) in the management of renal anemia in patients undergoing maintenance hemodialysis. Methods This was a prospective, open‐label, randomized controlled trial.
Lingling Chen, Junjie Zhu, Qiaonan Ge
wiley   +1 more source