• 한국정보과학회논문지:시스템및이론
• /
• 제34권5_6호
• /
• pp.187-194
• /
• 2007

Local alignment 알고리즘은 두 문자열을 비교하여 크기가 l, 유사도 점수가 s인 부분 문자열쌍을 찾는다. 크기가 충분히 크고 유사도 점수도 높은 부분 문자열 쌍을 찾기 위해 단위 길이당 유사도 점수 s/l을 최대화하는 정규화 방법이 제안되어있다. 본 논문에서는 증가함수 f, g를 도입하여 f(s)/g(l)을 최대화하는, 함수에 의한 정규화 방법을 제시한다. 여기서 함수 f, g는 DNA 서열을 비교하는 실험을 통해 정한다. 이러한 실험에서 함수에 의한 정규화 방법이 좋은 local alignment를 찾는다. 또한 유사도 점수의 기준으로 longest common subsequence를 채택한 경우, 기존의 정규화 알고리즘을 이용하면 별다른 시간 손실 없이 함수에 의해 정규화된 점수 f(s)/g(l)을 최대화 할 수 있음을 보인다.

• 문화기술의 융합
• /
• 제5권3호
• /
• pp.339-344
• /
• 2019

서열 정렬에 있어서 전체를 비교하여 두 서열 사이의 최대의 유사성 또는 상동성을 찾는 전역 정렬은 넓은 범위를 선호하게 되는 편향성을 갖게 된다. 비일치 부분을 과감히 제거하고 높은 일치도를 갖는 부분 영역을 정렬하게 되면 정렬점수를 높이는 효과를 갖게 된다. 여러 개의 부분 지역 정렬을 탐색하게 하는 다중 지역정렬 방법을 적용하여 다수의 지역정렬을 수행하는 알고리즘을 구현하고 결과를 분석해 본다. 지역 정렬에 일반적으로 사용되는 Smith-Waterman 알고리즘의 제한점 중 하나인 서열이 길어지는 것을 방지하고, sub-optimal sequence를 찾기 위한 방법을 응용하여 다중지역 정렬을 수행한다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(4)
• /
• 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
• /
• 제22권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.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제16권3호
• /
• pp.275-280
• /
• 2010

지역정렬(local alignment) 알고리즘은 주어진 두 서열에서 서로 유사한 부분 문자열을 찾아내는 알고리즘이다. DNA 서열은 A, C, G, T 외에 N과 X도 가질 수 있는데, N과 X는 DNA로부터 염기배열 정보를 뽑아낼 때 실험적인 이유로 혹은 다른 이유로 일부 배열 정보를 잃어버린 경우에 사용된다. 본 논문에서는 A, C, G, T 이외에 N과 X를 모두 갖는 DNA 서열의 affine gap penalty metric에 대한 지역정렬을 찾는 효율적인 알고리즘을 제시한다. 이는 N만 처리할 수 있는 Kim-Park 알고리즘을 N과 X를 모두 처리할 수 있도록 성공적으로 확장한 결과이며, 더불어 새로운 문자가 추가되더라도 바로 적용이 가능한 일반화된 결과이다.

• 한국측량학회:학술대회논문집
• /
• 한국측량학회 2003년도 추계학술발표회 논문집
• /
• 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
• /
• 제1권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
• /
• 제42권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.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2003년도 춘계학술발표논문집 (중)
• /
• pp.1019-1022
• /
• 2003

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

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• 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.