磁共振T1rho序列、T2 mapping技术在膝关节早期软骨退变早期诊断中的评估价值

目的探讨磁共振T1rho序列、T2 mapping技术在膝关节早期软骨退变早期诊断中的评估价值。方法选取2020年1月至2022年11月在我院治疗的110例膝关节早期软骨退变患者(观察组),按照疾病严重程度分为轻度退变组及重度退变组,另选取同期在我院进行体检的64例健康者为对照组,受试者均行磁共振T1rho序列、T2 mapping技术扫描,测量受试者T2值及T1ρ值,探讨磁共振T1rho序列、T2 mapping技术在膝关节早期软骨退变早期诊断中的评估价值。结果观察组股骨外侧面、股骨内侧面、胫骨外侧面、胫骨内侧面、髋骨面T2值均明显高于对照组(P<0.05),重度退变亚组患者股骨外侧面、股骨内侧面、胫骨外侧面、胫骨内侧面、髋骨面T2值显著高于轻度退变者(P<0.05);观察组股骨内踝负重区、股骨内踝非负重区、股骨外踝负重区、股骨外踝非负重区、胫骨外侧平台区、胫骨内侧平台区、髌后软骨区磁共振T1ρ值明显高于对照组(P<0.05),重度退变亚组患者股骨内踝负重区、股骨内踝非负重区、股骨外踝负重区、股骨外踝非负重区、胫骨外侧平台区、胫骨内侧平台区、髌后软骨区磁共振T1ρ值明显高于轻度退变亚组患者(P<0.05);磁共振T1rho序列在膝关节早期软骨退变中早期诊断及严重程度评估中的的诊断ROC值及特异度明显高于T2 mapping技术(P<0.05),但后者具有更高的敏感度(P<0.05)。结论磁共振T1rho序列、T2 mapping技术均能有效反映膝关节早期软骨退变中软骨组织学成分变化情况,还可为膝关节软骨退变严重程度评估提供客观依据,二者具有一定互补价值。

Construction of SNP genetic maps based on targeted next-generation sequencing and QTL mapping of vital agronomic traits in faba bean(Vicia faba L.)

Owing to the limitation of a large genome size(~13 Gb),the genetic and gene mapping studies on faba bean(Vicia faba L.)are lagging far behind those for other legumes.In this study,we selected three purified faba bean lines(Yundou 8137,H0003712,and H000572)as parents and constructed two F2 populations.These two F2 populations,namely 167 F2 plants in Pop1(Yundou 8137×H0003712)and 204 F2 plants in Pop2(H000572×Yundou 8137),were genotyped using a targeted next-generation sequencing(TNGS)genotyping platform,and two high-density single nucleotide polymorphisms(SNP)genetic linkage maps of faba bean were constructed.The map constructed from Pop1 contained 5103 SNPs with a length of 1333.31 cM and an average marker density of 0.26 cM.The map constructed from Pop2 contained 1904 SNPs with a greater length of 1610.61 cM.In these two F2 populations,QTL mapping identified 98 QTLs for 14 agronomic traits related to the flowers,pods,plant types and grains.The two maps were then merged into an integrated genetic linkage map containing 6895 SNPs,with a length of 3324.48 cM.These results not only lay the foundation for fine mapping and map-based cloning of related genes,but can also accelerate the molecular marker-assisted breeding of faba bean.

CONVERGENT PROBLEM OF ITERATIVE SEQUENCES FOR NONLINEAR MAPPINGS WITH ERROR MEMBERS IN BANACH SPACES

In this paper,the approximation problems of Ishikawa iteration with errors of fixed points for asymptotically nonexpansive mappings and asymptotically pseudocontractive mappings in arbitrary real Banach spaces are investigated.Some necessary condition and sufficient condition for the convergence of iterative sequences are given respectively.The results thus extend and improve some recent corresponding results.

A New Hybrid Algorithm and Its Numerical Realization for a Quasi-nonexpansive Mapping

The purpose of this article is to propose a new hybrid projection method for a quasi-nonexpansive mapping. The strong convergence of the algorithm is proved in real Hilbert spaces. A numerical experiment is also included to explain the effectiveness of the proposed methods. The results of this paper are interesting extensions of those known results.

Mapping a Rice Glabrous Gene Using Simple Sequence Repeat Markers

Inheritance analysis and gene mapping of the glabrous trait were conducted using the crosses between a pubescent rice material Chuanxiang 29B （an aromatic elite maintainer line of hybrid rice）, and two glabrous rice materials, Lemont and R2 （R2 is a new restorer line of hybrid rice）. All F1 plants from the two crosses had pubescent leaves, confirming that the pubescence trait in Chuanxiang 29B is dominant over the glabrous trait. In F2 individuals, the segregation ratio of three pubescent to one glabrous plant suggests that a single glabrous gene was present in Lemont and R2. Using the bulked segregant analysis, the linkage analysis of the simple sequence repeat markers showed that the glabrous gene, gl-1, was flanked by GL311 and GL8 with the genetic distances of 0.19 and 0.92 cM on chromosome 5, respectively.

CONVERGENCE OF ISHIKAWA TYPE ITERATIVE SEQUENCE WITH ERRORS FOR QUASI-CONTRACTIVE MAPPINGS IN CONVEX METRIC SPACES

Some convergence theorems of Ishikawa type iterative sequence with errors for nonlinear general quasi-contractive mapping in convex metric spaces are proved. The results not only extend and improve the corresponding results of L. B. Ciric, Q. H. Liu, H. E. Rhoades and H. K. Xu, et al., but also give an affirmative answer to the open question of Rhoades-Naimpally- Singh in convex metric spaces.

Common Fixed Point Theorems for Sequences of φ-type Contraction Set-valued Mappings

在完全的公制的空格，为类型收缩的序列的普通的固定的点定理珍视集合的 mappings 被建立，并且为珍视集合的 mappings 的相应的随机的普通的固定的点定理也被获得。

SOME CONVERGENCE PROBLEM OF ITERATIVE SEQUENCESFOR ACCRETIVE AND PSEUDO-CONTRACTIVETYPE MAPPING IN BANACH SPACES

Some necessary and sufficient conditions for convergence of Ishikawa Mann and steepest descent iterative sequence for accretive and pseudo-contractive type mapping in Banach spaces were obtained. The results improve, extend and include some recent results.

Strong and Weak Convergence Theorems of the Sequence of Ishikawa Iterates for Demicontractive Mappings

ＳｔｒｏｎｇａｎｄＷｅａｋＣｏｎｖｅｒｇｅｎｃｅＴｈｅｏｒｅｍｓｏｆｔｈｅＳｅｑｕｅｎｃｅｏｆＩｓｈｉｋａｗａｉｔｅｒａｔｅｓｆｏｒＤｅｍｉｃｏｎｔｒａｃｔｉｖｅＭａｐｐｉｎｇｓＬｉｕＱｉｈｏｕ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，Ｂｅｉ...

Rapid Texture Mapping from Image Sequences for Building Geometry Model

An effective approach, mapping the texture for building model based on the digital photogrammetric theory, is proposed. The easily-acquired image sequences from digital video camera on helicopter are used as texture resource, and the correspondence between the space edge in building geometry model and its line feature in image sequences is determined semi-automatically. The experimental results in production of three-dimensional data for car navigation show us an attractive future both in efficiency and effect.

A new iterative process for approximating common fixed points of nonself I-asymptotically quasi-nonexpansive mappings

In this paper, we introduce an iterative process for two nonself I-asymptotically quasi-nonexpansive mappings and two finite families of such mappings in Banach spaces, and prove some strong convergence theorems for such mappings. Our results extend some existing results.

Convergence of Iterative Sequence with Mixed Errors for Uniformly Quasi-Lipschitzian Mappings

In convex metric spaces, the sufficient and necessary conditions for Ishikawa iterative sequences of uniformly quasi-Lipschitzian mapping T with mixed errors to converge to a fixed point ate proved, and as a special case, in which T need not be continuous. The results of this paper improve and extend some recent results.

Common Fixed Point Iterations of Generalized Asymptotically Quasi-Nonexpansive Mappings in Hyperbolic Spaces

We introduce a general iterative method for a finite family of generalized asymptotically quasi- nonexpansive mappings in a hyperbolic space and study its strong convergence. The new iterative method includes multi-step iterative method of Khan et al. [1] as a special case. Our results are new in hyperbolic spaces and generalize many known results in Banach spaces and CAT(0) spaces, simultaneously.

WEAK SEQUENCE-COVERING MAPPING AND CS-NETWORK

A mapping f: X→Y is called weak sequence-covering if whenever {ya} is a sequence in Y converging to y ∈ Y, there exist a subsequence {ynk} and xk∈f^-1(ynk)(k∈N) ,x∈f^-1 (y) such that xk→x. The main results are: (1) Y is a sequential, Frechet, strongly Frechet space iff every weak sepuence-covering mapping onto Y is quotient, pseudo-open, countably bi-quotient respectively, (2) weak sequence-covering mapping preserves cs-network and certain k-(cs-)networks, thus some new mapping theorems on k-(cs-)notworks are proved.

SLAF marker based QTL mapping of fruit-related traits reveals a major-effect candidate locus ff2.1 for flesh firmness in melon

Flesh firmness(FF) is an important and complex trait for melon breeders and consumers. However, the genetic mechanism underlying FF is unclear. Here, a soft fruit melon(P5) and a hard fruit melon(P10) were crossed to generate F2, and the FF and fruit-related traits were recorded for two years. By performing quantitative trait locus(QTL) specificlocus amplified fragment(SLAF)(QTL-SLAF) sequencing and molecular marker-linkage analysis, 112 844 SLAF markers were identified, and 5 919 SNPs were used to construct a genetic linkage map with a total genetic distance of1 356.49 cM. Ten FF-and fruit-related QTLs were identified. Consistent QTLs were detected for fruit length(FL) and fruit diameter(FD) in both years, and QTLs for single fruit weight(SFW) were detected on two separate chromosomes in both years. For FF, the consistent major locus(ff2.1) was located in a 0.17-Mb candidate region on chromosome 2. Using 429 F2individuals derived from a cross between P5 and P10, we refined the ff2.1 locus to a 28.3-kb region harboring three functional genes. These results provide not only a new candidate QTL for melon FF breeding but also a theoretical foundation for research on the mechanism underlying melon gene function.

Quantitative Trait Loci(QTL)Mapping and Marker Analysis of Fatty Acids in Peanut

Peanut,with high oil content,has been a major oil and food crop globally.The compositions of the fatty acids are the common factors in determining the oil quality.In the present study,an F2 segregated population with 140 individuals derived from the cross of Weihua8(a cultivar)and 12L49(a line with high oleic acid concentration)was used to construct a genetic map and conduct QTL mapping analysis.A total of 103 polymorphic SSR primers were utilized for genotyping the RILs and finally generating the SSR loci.Within the 103 SSR loci,a genetic linkage map,covering a total length of 3592.35 cM of the whole peanut genome,was constructed.Based on the genetic map,sixteen QTLs located on nine linkage groups related to peanut fatty acids were finally identified.Among them,four QTLs were detected associated with various traits simultaneously,which showed genetic stability in relation to fatty acids of peanut.Except for the QTLs for oleic acid,linoleic acid,and linolenic acid,three novel QTLs for arachidic acid and behenic acid were also detected.These QTLs might be helpful for further fine mapping analysis and marker-assisted selection of fatty acids in peanut.

Variant Map System to Simulate Complex Properties of DNA Interactions Using Binary Sequences

Stream cipher, DNA cryptography and DNA analysis are the most important R&D fields in both Cryptography and Bioinformatics. HC-256 is an emerged scheme as the new generation of stream ciphers for advanced network security. From a random sequencing viewpoint, both sequences of HC-256 and real DNA data may have intrinsic pseudo-random properties respectively. In a recent decade, many DNA sequencing projects are developed on cells, plants and animals over the world into huge DNA databases. Researchers notice that mammalian genomes encode thousands of large noncoding RNAs (lncRNAs), interact with chromatin regulatory complexes, and are thought to play a role in localizing these complexes to target loci across the genome. It is a challenge target using higher dimensional visualization tools to organize various complex interactive properties as visual maps. The Variant Map System (VMS) as an emerging scheme is systematically proposed in this paper to apply multiple maps that used four Meta symbols as same as DNA or RNA representations. System architecture of key components and core mechanism on the VMS are described. Key modules, equations and their I/O parameters are discussed. Applying the VM System, two sets of real DNA sequences from both sample human (noncoding DNA) and corn (coding DNA) genomes are collected in comparison with pseudo DNA sequences generated by HC-256 to show their intrinsic properties in higher levels of similar relationships among relevant DNA sequences on 2D maps. Sample 2D maps are listed and their characteristics are illustrated under controllable environment. Visual results are briefly analyzed to explore their intrinsic properties on selected genome sequences.

2D Conjugate Maps of DNA Sequences

Random sequences play an important role in wider security applications, such as mobile communication and network security. Due to DNA sequences owning natural randomness, in order to show DNA’s characteristics intuitively, this paper proposes a method to present DNA sequences as conjugate maps. The method includes two core models: measuring models to transfer DNA data into measurements, and visual models to test random sequences as distribution maps to show DNA’s characteristics. The spatial relations between sample DNA and CA random sequences are illustrated and compared in the end. The results show that the distribution of DNA sequences and CA random sequences has significant differences and similarities. It can provide a reference for in-depth visualization study of DNA sequences on their measurement maps.

一种针对大规模Read Mapping的高效DBG索引方法

为了能够回答生物信息学中关于de Bruijn graph(DBG)的两个问题——①对于任意的k-mer,回答其是否为DBG的顶点,②对于DBG的任意顶点,回答其邻接信息(入边和出边),提出了一种针对大规模read mapping的高效DBG索引方法.本文将以上两个问题转化为非重复多路径上的k-mer和(k+1)-mer的确切查找问题,并利用FM-index进行解决.首先,对给定的参考序列进行压缩,即非重复多路径的发现,从而压缩了序列中大量存在的重复(k+1)-mer.其次,基于非重复多路径FM-index对DBG进行索引.查找k-mer是否出现在DBG上,若找到,给出该k-mer的直接前驱和直接后继结点,从而提高时空效率.最后,在62种大肠杆菌菌株的基因组上进行实验.实验结果表明,所提出的方法可以高效地对多参考序列的DBG进行索引.

On the Judgement of Full-Period Sequences and a Novel Congruential Map with Double Modulus on Z(p^n)

This paper studies the judgement problem of full-period maps on Z(p^n) and proposes a novel congruential map with double modulus on Z(p^n). The full-period properties of the sequences generated by the novel map are studied completely. We prove some theorems including full-period judgement theorem on Z(p^n) and validate them by some numerical experiments. In the experiments, full-period sequences are generated by a full-period map on Z(p^n). By the binarization, full-period sequences are transformed into binary sequences. Then, we test the binary sequences with the NIST SP 800-22 software package and make the poker test. The passing rates of the statistical tests are high in NIST test and the sequences pass the poker test. So the randomness and statistic characteristics of the binary sequences are good. The analysis and experiments show that these full-period maps can be applied in the pseudo-random number generation(PRNG), cryptography, spread spectrum communications and so on.