• Archives of Pharmacal Research
• /
• v.21 no.4
• /
• pp.385-390
• /
• 1998

Adozelesin and carzelesin are synthetic analogues of the extremely potent antitumor antibiotic CC-1065, which alkylates N3 of adenine in a consensus sequence $5^1$-(A/T)(A/T)$A^*$ ($A^*$ is the site of alkylation). We have investigated the DNA sequence selectivity of adozelesin and carzelesin by thermally ind ced DNA strand cleavage assay using radiolabeled restriction DNA fragments. An analysis of alkylation patterns shows that the consensus sequences for carzelesin and adozelesin have been found to be $5^1$-(A/T)(A/T)$A^*$ and $5^1$-(A/F)(G/C)(A/T)$A^*$. A new consensus sequence, $5^1$-(A/T)(A/T)$CA^*$, has been observed to display an additional alkylation site for adozelesin but not for carzelesin. These results indicate that the pattern of sequence selectivity induced by carzelesin is similar but not identical to those induced by adozelosin.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4645-4664
• /
• 2019

It is significant to construct deterministic measurement matrices with easy hardware implementation, good sensing performance and good cryptographic property for practical compressed sensing (CS) applications. In this paper, a deterministic construction method of bipolar chaotic measurement matrices is presented based on binary sequence family (BSF) and Chebyshev chaotic sequence. The column vectors of these matrices are the sequences of BSF, where 1 is substituted with -1 and 0 is with 1. The proposed matrices, which exploit the pseudo-randomness of Chebyshev sequence, are sensitive to the initial state. The performance of proposed matrices is analyzed from the perspective of coherence. Theoretical analysis and simulation experiments show that the proposed matrices have limited influence on the recovery accuracy in different initial states and they outperform their Gaussian and Bernoulli counterparts in recovery accuracy. The proposed matrices can make the hardware implement easy by means of linear feedback shift register (LFSR) structures and numeric converter, which is conducive to practical CS.

• Journal of Microbiology and Biotechnology
• /
• v.10 no.5
• /
• pp.643-650
• /
• 2000

A new aniline-utilizing microorganism, strain HY1 obtained from an orchard soil, was characterized by using the BIOLOG system, an analysis of the total cellular fatty acids, and a 16S rDNA sequence. Strain HY1 was identified as a Burkholderia species, and was designated Burkholderia sp. HY1. GC and HPLC analyses revealed that Burkholderia sp. HY1 was able to degrade aniline to produce catechol, which was subsequently converted to cis,cis-muconic acid through an ortho-ring fission pathway under aerobic conditions. Strain HY1 exhibited a drastic reduction in the rate of aniline degradation when glucose was added to the aniline media. However, the addition of peptone or nitrate to the aniline media dramatically accelerated the rate of aniline degradation. A fatty acid analysis showed that strain HY1 was able to produce lipids 16:0 2OH, and 11 methyl 18:1 ${\omega}7c$ approximately 3.7-, 2.2-, and 6-fold more, respectively, when grown on aniline media than when grown on TSA. An analysison the alignment of a 1,435 bp fragment. A phylogenetic analysis of the 16S rDNA sequence based on a 1,420 bp multi-alignment sowed of the 16s rDNA sequence revealed that strain HY1 was very closely related to Burkholderia graminis with 95% similarity based that strain HY1 was placed among three major clonal types of $\beta$-Proteobacteria, including Burkholderia graminis, Burkholderia phenazinium, and Burkholderia glathei. The sequence GAT(C or G)${\b{G}}$, which is highly conserved in several locations in the 16S rDNA gene among the major clonal type strains of $\beta$-Proteobacteria, was frequently replaced with GAT(C or G)${\b{A}}$ in the 16S rDNA sequence from strain HY1.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.10
• /
• pp.2283-2291
• /
• 2010

The shrinking generator which is one of clock-controlled generator is a very simple generator with good cryptographic properties. A nonlinear sequence generator based on two 90/150 maximum length cellular automata can generate pseudorandom sequences at each cell of cellular automata whose characteristic polynomials are same. The nonlinear sequence generated by cellular automata has a larger period and a higher linear complexity than shrunken sequence generated by LFSRs. In this paper we analyze shrunken-interleaved sequence based on 90/150 maximum length cellular automata. We show that the sequence generated by nonlinear sequence generator based on cellular automata belongs to the class of interleaved sequence. And we give an effective algorithm for reconstructing unknown bits of output sequence based on intercepted keystream bits.

• Journal of Plant Biotechnology
• /
• v.29 no.3
• /
• pp.161-170
• /
• 2002

For the hairy root of Panax ginseng, we have got mass spectrums from MALDI/TOF/MS analysis and Tandem mass spectrums from ESI/Q-TOF/MS analysis. While mass spectrum provides the molecular weights of peptide fragments digested by protease such as trypsin, tandem mass spectrum produces amino acid sequence of digested peptides. Each amino acid sequences can be a query sequence in BLAST search to identify proteins. For the specimens of animals or plants of which genome sequences were known, we can easily identify expressed proteins from mass spectrums with high accuracy. However, for the other specimens such as ginseng, it is difficult to identify proteins with accuracy since all the protein sequences are not available yet. Here we compared the mass spectrums and the peptide amino acid sequences with ginseng expressed sequence tag (EST) DB. The matched EST sequence was used as a query in BLAST search for protein identification. They could offer the correct protein information by the sequence alignment with EST sequences. 90% of peptide sequences of ESI/Q-TOF/MS are matched with EST sequences. Comparing 68% matches of the same sequences with the nr database of NCBI, we got more matches by 22% from ginseng EST sequence search. In case of peptide mass fingerprinting from MALDI/TOF/MS, only about 19% (9 proteins of 47 spots) among peptide matches from nr DB were correlated with ginseng EST DB. From these results, we suggest that amino acid sequencing using tandem mass spectrum analysis may be necessary for protein identification in ginseng proteome analysis.

• The Journal of Information Systems
• /
• v.22 no.3
• /
• pp.25-42
• /
• 2013

Recently various kinds of Information Technology services are created and the quantities of the data flow are increase rapidly. Not only that, but the data patterns that we deal with also slowly becoming diversity. As a result, the demand of discover the meaningful knowledge/information through the various mining analysis such as linkage analysis, sequencing analysis, classification and prediction, has been steadily increasing. However, solving the business problems using data mining analysis does not always concerning, one of the major causes of these limitations is there are some analyzed data can't accurately reflect the real world phenomenon. For example, although the time gap of purchasing the two products is very short, by using the traditional sequencing analysis, the precedence relationship of the two products is clearly reflected. But in the real world, with the very short time interval, the precedence relationship of the two purchases might not be defined. What was worse, the sequence of the purchase intention and the sequence of the purchase realization of the two products might be mutually be reversed. Therefore, in this study, an expanded sequencing analysis methodology has been proposed in order to reflect this situation. In this proposed methodology, the purchases that being made in a very short time interval among the purchase order which might not important will be notice, and the analysis which included the original sequence and reversed sequence will be used to extend the analysis of the data. Also, to some extent a very short time interval can be defined as the time interval, so an experiment were carried out to determine the varying based on the time interval for the actual data.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.39 no.3
• /
• pp.461-467
• /
• 2019

Advances in location-aware and IoT (Internet of Things) technology increase the rapid generation of massive movement data. Knowledge discovery from massive movement data helps us to understand the urban flow and traffic management. This paper proposes a method to analyze frequent origin-destination sequence patterns from irregular spatiotemporal taxi pick-up locations. The proposed method starts by conducting cluster analysis and then run a frequent sequence pattern analysis based on identified clusters as a base unit. The experimental data is Seoul taxi trajectory data between 7 a.m. and 9 a.m. during one week. The experimental results present that significant frequent sequence patterns occur within Gangnam. The significant frequent sequence patterns of different regions are identified between Gangnam and Seoul City Hall area. Further, this study uses administrative boundaries as a base unit. The results based on administrative boundaries fails to detect the frequent sequence patterns between different regions. The proposed method can be applied to decrease not only taxis' empty-loaded rate, but also improve urban flow management.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.1-10
• /
• 2005

Multiple sequence alignment(MSA) is a fundamental technique of DNA and Protein sequence analysis. Biological sequences are aligned vertically in order to show the similarities and differences among them. In this Paper, we Propose an effcient group alignment method, which is based on clustering divergency, to Perform the alignment between two groups of sequences. The Proposed algorithm is a clustering divergence(CDMS)-based multiple sequence alignment and a top-down approach. The algorithm builds the tree topology for merging. It is so based on the concept that two sequences having the longest distance should be spilt into two clusters. We expect that our sequence alignment algorithm improves its qualify and speeds up better than traditional algorithm Clustal-W.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.9
• /
• pp.401-408
• /
• 2006

In a multi-sensor multi-target tracking systems, the local sensors have the role of tracking the target and transferring the measurements to the fusion center. The measurements from the same target can arrive out of sequence called the out-of-sequence measurements(OOSMs). Out-of-sequence measurements can arise at the fusion center due to communication delay and varying preprocessing time for different sensor platforms. In general, the track fusion occurs to enhance the tracking performance of the sensors using the measurements from the sensors at the fusion center. The target informations can wive at the fusion center with the clutter informations in cluttered environment. In this paper, the OOSM update step with MPDA(Most Probable Data Association) is introduced and tested in several cases with the various clutter density through the Monte Carlo simulation. The performance of the MPDA with OOSM update step is compared with the existing NN, PDA, and PDA-AI for the air target tracking in cluttered and out-of-sequence measurement environment. Simulation results show that MPDA with the OOSM has compatible root mean square errors with out-of-sequence PDA-AI filter and the MPDA is sufficient to be used in out-of-sequence environment.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.10 s.89
• /
• pp.996-1004
• /
• 2004

1-Dimensional Cluster-Based Sequence Equalizer(1-D CBSE) lessens computational load, compared with the classic maximum likelihood sequence estimation(MLSE) equalizers, and has the superiority in the nonlinear channels. In this paper, we proposed an algorithm of searching for optimal training sequence that estimates the cluster centers instead of time-varying multipath fading channel estimation. The proposed equalizer not only resolved the problems in 1-D CBSE but also improved the bandwidth efficiency using the shorten length of taming sequence to improve bandwidth efficiency. In experiments, the superiority of the new method is demonstrated by comparing conventional 1-D CBSE and related analysis.