• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1A
• /
• pp.42-50
• /
• 2002

In this paper, for a prime number p, a construction method to genarate p-ary d-from sequences with ideal autocorrelation property is proposed and using the ternary sequences with ideal autocorrelation found by Helleseth, Kumar and Martinsen, ternary d-form sequences with ideal autocorrelation introduced. By combining the methods for generation the p-ary extended sequence (a special case of geometric sequences) and the p-ary d-from sequences, a construction method of p-ary unified (extended d-form) sequences which also have ideal autocorrelation property is proposed, which is very general class of p-ary sequences including the binary and nonbinary extended sequences and d-form seuqences. Form the ternary sequences with ideal autocorrelation by Helleseth, Kumar and Martinesen, ternary unified sequences with ideal autocorrelation property are also generated.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.10
• /
• pp.2181-2187
• /
• 2011

In this paper, a family of binary sequences generated by GMW sequences and No sequences is introduced and analyzed. Each sequence within a family has period $N=2^n-1$, n=2m and there are $2^m$ sequences within that family. We obtain auto and cross-correlation values and linear span of the synthesized sequence.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.6
• /
• pp.217-222
• /
• 1997

Recently, No et al. presented a new construction of binary sequences with ideal autocorrelation property. In this paper, we applied this method into some of the well-known binary sequences with ideal autocorrelation, and the results are described in detail. First, the GMW sequences are shown to be a natural extension of m-sequences with respect to this method. Second, new binary sequences with ideal autocorrelation property are explicitly constructed from Legendre sequences, Hall's sextic residue sequences, and other known sequences of miscellaneous type.

• International Journal of Contents
• /
• v.3 no.2
• /
• pp.18-24
• /
• 2007

Biological sequences such as DNA and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of more than hundreds of frequent items. In biological sequences analysis(BSA), a frequent contiguous sequence search is one of the most important operations. Many studies have been done for mining sequential patterns efficiently. Most of the existing methods for mining sequential patterns are based on the Apriori algorithm. In particular, the prefixSpan algorithm is one of the most efficient sequential pattern mining schemes based on the Apriori algorithm. However, since the algorithm expands the sequential patterns from frequent patterns with length-1, it is not suitable for biological datasets with long frequent contiguous sequences. In recent years, the MacosVSpan algorithm was proposed based on the idea of the prefixSpan algorithm to significantly reduce its recursive process. However, the algorithm is still inefficient for mining frequent contiguous sequences from long biological data sequences. In this paper, we propose an efficient method to mine maximal frequent contiguous sequences in large biological data sequences by constructing the spanning tree with a fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. The experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.

• Genomics & Informatics
• /
• v.5 no.2
• /
• pp.68-76
• /
• 2007

Due to the increasing interest in SNPs and mutational hot spots for disease traits, it is becoming more important to define and understand the relationship between SNPs and their flanking sequences. To study the effects of flanking sequences on SNPs, statistical approaches are necessary to assess bias in SNP data. In this study we mainly applied Markov chains for SNP sequences, particularly those located in intronic regions, and for analysis of in-del data. All of the pertaining sequences showed a significant tendency to generate particular SNP types. Most sequences flanking SNPs had lower complexities than average sequences, and some of them were associated with microsatellites. Moreover, many Alu repeats were found in the flanking sequences. We observed an elevated frequency of single-base-pair repeat-like sequences, mirror repeats, and palindromes in the SNP flanking sequence data. Alu repeats are hypothesized to be associated with C-to-T transition mutations or A-to-I RNA editing. In particular, the in-del data revealed an association between particular changes such as palindromes or mirror repeats. Results indicate that the mechanism of induction of in-del transitions is probably very different from that which is responsible for other SNPs. From a statistical perspective, frequent DNA lesions in some regions probably have effects on the occurrence of SNPs.

• Investigative Magnetic Resonance Imaging
• /
• v.4 no.1
• /
• pp.20-26
• /
• 2000

Gradient moment nulling techniques require the introduction of an additional gradient on each axis for each order of motion correction to be applied. The additional gradients introduce new constraints on the sequence design and increase the demands on the gradient system. The purpose of this paper is to demonstrate techniques for optimization of gradient echo gradient moment nulling sequences within the constraints of the gradient hardware. Flow compensated pulse sequences were designed and implemented on a clinical magnetic resonance imaging system. The design of the gradient moment nulling sequences requires the solution of a linear system of equations. A Mathematica package was developed that interactively solves the gradient moment nulling problem. The package allows the physicist to specify the desired order of motion compensation and the duration of the gradients in the sequence with different gradient envelopes. The gradient echo sequences with first, second, and third order motion compensation were implemented with minimum echo time. The sequences were optimized to take full advantage of the capabilities of the gradient hardware. The sequences were used to generate images of phantoms and human brains. The optimized sequences were found to have better motion compensation than comparable standard sequences.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.4
• /
• pp.231-238
• /
• 2009

DNA sequences are the fundamental information for each species and a comparison between DNA sequences of different species is an important task. Since DNA sequences are very long and there exist many species, not only fast matching but also efficient storage is an important factor for DNA sequences. Thus, a fast string matching method suitable for encoded DNA sequences is needed. In this paper, we present a fast string matching method for encoded DNA sequences which does not decode DNA sequences while matching. We use four-characters-to-one-byte encoding and combine a suffix approach and a multi-pattern matching approach. Experimental results show that our method is about 5 times faster than AGREP and the fastest among known algorithms.

• Journal of Forest and Environmental Science
• /
• v.28 no.4
• /
• pp.278-281
• /
• 2012

Comparative sequence analyses were conducted on complete mtDNA sequences from four small mammal species in Korea and revealed the presence of 30 well conserved sequences in various regions of the complete mtDNA sequences. The conserved sequences were found in 9 regions in protein coding genes, 10 regions in tRNA genes, 10 in rRNA genes, one region in replication origin and 2 regions in D loop. They could be used to design primers for amplifying complete mtDNA sequences of small mammals.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.12
• /
• pp.40-50
• /
• 1993

This paper presents a new method for generating assembly sequences. The method acquires constraints on sequencing the assembly tasks without redundancy. Then it generates the assembly sequences without seatching undesirable tasks by recursively searching all assembly tasks which do not violate the assembly constraints. Since the method does not search undesirable tasks, it can generate assembly sequences for complex products. Current available methods may not generate assembly sequences for the complex product since their search-space increases explosively as the number of parts rises.

• Journal of the Korean Statistical Society
• /
• v.24 no.1
• /
• pp.249-256
• /
• 1995

In this note we prove an invariance principle for strictly stationary linear positive quadrant dependent sequences, satifying some assumption on the covariance structure, $0 < \sum Cov(X_1,X_j) < \infty$. This result is an extension of Burton, Dabrowski and Dehlings' invariance principle for weakly associated sequences to LPQD sequences as well as an improvement of Newman's central limit theorem for LPQD sequences.