• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.187-194
• /
• 2007

A local alignment algorithm does comparing two strings and finding a substring pair with size l and similarity s. To find a pair with both sufficient size and high similarity, existing normalization approaches maximize the ratio of the similarity to the size. In this paper, we introduce normalization by functions that maximizes f(s)/g(l), where f and g are non-decreasing functions. These functions, f and g, are determined by experiments comparing DNA sequences. In the experiments, our normalization by functions finds appropriate local alignments. For the previous algorithm, which evaluates the similarity by using the longest common subsequence, we show that the algorithm can also maximize the score normalized by functions, f(s)/g(l) without loss of time.

• The Journal of the Convergence on Culture Technology
• /
• v.5 no.3
• /
• pp.339-344
• /
• 2019

Global sequence alignment in search of similarity or homology favors larger size of the sequence because it keeps looking for more similar section between two sequences in the hope that it adds up scores for matched part in the rest of the sequence. If a substantial size of mismatched section exists in the middle of the sequence, it greatly reduces the total alignment score. In this case a whole sequence would be better to be divided into multiple sections. Overall alignment score over the multiple sections of the sequence would increase as compared to global alignment. This method is called multiple local alignment. In this paper, we implement a multiple local alignment algorithm, an extension of Smith-Waterman algorithm and show the experimental results for the algorithm that is able to search for sub-optimal sequence.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.195-198
• /
• 2001

We proposes a new fingerprint minutia matching algorithm which matches the fingerprint minutiae by using local alignment. In general, fingerprint is deformed by Pressure and orientation when a user presses his fingerprint to the sensor. These nonlinear deformations change the position and the orientation of minutiae which decrease reliability of minutiae. Matching by using global alignment uses one alignment point. But, the problem with this method is that, due to the deformation, matching reliability of a minutia decreases as the distance from the alignment minutia increases. Matching by using local alignment overcomes this problem by considering minutiae which are located in a short distance boundary. Experimental results show that the performance of the proposed algorithm is superior to that of using global alignment.

• Journal of Information Technology Applications and Management
• /
• v.22 no.1
• /
• pp.131-152
• /
• 2015

Environmental differences across countries such as socio-cultural, political, economic, and technological differences require business strategies of multinational corporations to vary business practices across regions. Despite the keen awareness of the necessity for strategic adaptation to local context, IS management and strategy tend to remain similar across countries. One of the reasons is to maintain the stability and compatibility of information technology infrastructure. After a careful observation of retail business practice, this study finds IS strategy should also be highly responsive to the local context. This study shows how information resources including systems architecture, processes, human resources, and national context are interlinked together. Despite global excellence in general systems management, failure in such alignment can be a serious problem in extending competitive advantages across regions. This study aims to reveal issues to be taken care of in order to accomplish global technological alignment. Results of this study provide senior management with guidelines and a framework for aligning IT with regional strategic thrust that can improve local responsiveness of multinational companies.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.3
• /
• pp.275-280
• /
• 2010

A local alignment algorithm finds a substring pair of given two strings where two substrings of the pair are similar to each other. A DNA sequence can consist of not only A, C, G, and T but also N and X where N and X are used when the original bases lose their information for various reasons. In this paper, we present an efficient local alignment algorithm for two DNA sequences including N and X using the affine gap penalty metric. Our algorithm is an extended version of the Kim-Park algorithm and can be extended in case of including other characters which have similar properties to N and X.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2003.10a
• /
• pp.341-345
• /
• 2003

This study develops modeling processes for alignment optimization considering characteristics of intersections using genetic algorithms and GIS for road alignment optimization. Since existing highway alignment optimization models have neglected the characteristics of intersections, they have shown serious weaknesses for real applications. In this paper, intersection costs include earthwork, right-of-way, pavement, accident, delay and fuel consumption costs that are sensitive and dominating to alignments. Also, local optimization of intersections for saving good alignment alternatives is developed and embedded. A highway alignment is described by parametric representation in space and vector manipulation is used to find the coordinates of intersections and other interesting points. The developed intersection cost estimation model is sufficiently precise for estimating intersection costs and eventually enhancing the performance of highway alignment optimization models. Also, local optimization of intersections can be used for improving search flexibility, thus allowing more effective intersections. It also provides a basis for extending the alignment optimization from single highways to networks. The presented two artificial examples show that the total intersection costs are substantial and sensitive to highway alignments.

• Genomics & Informatics
• /
• v.1 no.1
• /
• pp.25-31
• /
• 2003

Local alignment is an important task in molecular biology to see if two sequences contain regions that are similar. The most popular approach to local alignment is the use of dynamic programming due to Smith and Waterman, but the alignment reported by the Smith-Waterman algorithm has some undesirable properties. The recent approach to fix these problems is to use the notion of normalized scores for local alignments by Arslan, Egecioglu and Pevzner. In this paper we consider the problem of finding all local alignments whose normalized scores are above a given threshold, and present a fast heuristic algorithm. Our algorithm is 180-330 times faster than Arslan et al.'s for sequences of length about 120 kbp and about 40-50 times faster for sequences of length about 30 kbp.

• Journal of Korean Neurosurgical Society
• /
• v.42 no.4
• /
• pp.271-275
• /
• 2007

Objective : Although a significant correction of local kyphosis has been reported previously, only a few studies have investigated whether this correction leads to an improved overall sagittal alignment. The study objective was to determine whether an improvement in the local kyphotic angle improves the overall sagittal alignment. We examined and compared the effects of thoracic and lumbar level kyphoplasty procedures on local versus overall sagittal alignment of the spine. Methods : Thirty-eight patients with osteoporotic vertebral compression fractures who showed poor response to conventional, palliative medical therapy underwent single-level kyphoplasty. The pertinent clinical data of these patients, from June 2006 to November 2006, were reviewed retrospectively. We measured preoperative and postoperative vertebral body heights, which were classified as anterior, middle, or posterior fractured vertebral body heights. Furthermore, the local and overall sagittal angles after polymethylmethacrylate deposition were measured. Results : More height was gained at the thoracic level, and the middle vertebral height regained the most. A significant local kyphosis correction was observed at the fractured level, and the correction at larger spanning segments decreased with the distance from the fractured level. Conclusion : The inflatable balloon kyphoplasty procedure was the most effective in regaining the height of the thoracic fractured vertebra in the middle vertebral body. The kyphosis correction by kyphoplasty was mainly achieved in the fractured vertebral body. Sagittal angular correction decreased with an increase in the distance from the fractured vertebra. No significant improvement was observed in the overall sagittal alignment after kyphoplasty. Further studies in a larger population are required to clarify this issue.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.1019-1022
• /
• 2003

두 서열을 비교하여 유사성(similarity)이나 상동성(homology)를 찾기 위한 서열 정렬 방법 중에서 지역 정렬에 많이 사용되는 Smith-Waterman 알고리즘의 제한점인 Mosaic effect와 Shadow effect를 극복하기 위한 효율적인 방법을 살펴보고, 하나의 최대 값이 아닌 다수개의 최대 값을 찾아 다수개를 정렬함으로써 서열내에 존재 할 수 있는 다수개의 지역 정렬을 찾고 Normalized sequence alignment 알고리즘을 이용하여 서열 정렬된 결과들의 우선 순위를 매겨본다.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.395-398
• /
• 2005

The acquisition of a panoramic image has been popular in recent years due to its large number of applications. In this paper, we deal with generation of a full panoramic mosaic. When it mosaicing consecutive frames, a simple alignment method may lead to local and global alignment errors. These errors can make a full-view panoramic mosaic to be cracked. In order to solve this problem, we propose the bidirectional alignment with multi-anchor (BAMA) algorithm with a basic local alignment formula. Experimental results show that we can create full panoramic mosaics stably through the proposed algorithm.