• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.3
• /
• pp.135-139
• /
• 2009

The problems to compute the distances or similarities of multiple strings have been vigorously studied in such diverse fields as pattern matching, web searching, bioinformatics, computer security, etc. One well-known method to compare multiple strings in the given set is finding a consensus string which is a representative of the given set. There are two objective functions that are frequently used to find a consensus string, one is the radius and the other is the consensus error. The radius of a string x with respect to a set S of strings is the smallest number r such that the distance between the string x and each string in S is at most r. A consensus string based on radius is a string that minimizes the radius with respect to a given set. The consensus error of a string with respect to a given set S is the sum of the distances between x and all the strings in S. A consensus string of S based on consensus error is a string that minimizes the consensus error with respect to S. In this paper, we show that the problem of finding a consensus string based on radius is NP-complete when the distance function is a metric.

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.289-294
• /
• 2015

The consensus problem is finding a representative string, called a consensus, of a given set S of k strings. Circular strings are different from linear strings in that the last symbol precedes the first symbol. Given a set S of circular strings of length n over an alphabet ${\Sigma}$, we first present an $O({\mid}{\Sigma}{\mid}nlogn)$ time parallel algorithm for finding a consensus of S minimizing both radius and distance sum when k=3 using O(n) threads. Then we present an $O({\mid}{\Sigma}{\mid}n^2logn)$ time parallel algorithm for finding a consensus of S minimizing distance sum when k=4 using O(n) threads. Finally, we compare execution times of our algorithms implemented using CUDA with corresponding sequential algorithms.

• Journal of Gastric Cancer
• /
• v.19 no.2
• /
• pp.193-201
• /
• 2019

Purpose: There is no consensus on the optimal method for intracorporeal esophagojejunostomy (EJ) in laparoscopic total gastrectomy (LTG). This study aims to compare 2 established methods of EJ anastomosis in LTG. Materials and Methods: A total of 314 patients diagnosed with gastric cancer that underwent LTG in the period from January 2013 to October 2016 were enrolled in the study. In 254 patients, the circular stapler with purse-string "Lap-Jack" method was used, and in the other 60 patients the linear stapling method was used for EJ anastomosis. After propensity score matching, 58 were matched 1:1, and retrospective data for patient characteristics, surgical outcome, and post-operative complications was reviewed. Results: The 2 groups showed no significant difference in age, body mass index, or other clinicopathological characteristics. After propensity score matching analysis, the linear group had shorter operating time than the circular group ($200.3{\pm}62.0$ vs. $244.0{\pm}65.5$, $P{\leq}0.001$). Early postoperative complications in the circular and linear groups occurred in 12 (20.7%) and 15 (25.9%, P=0.660) patients, respectively. EJ leakage occurred in 3 (5.2%) patients from each group, with 1 patient from each group needing intervention of Clavien-Dindo grade III or more. Late complications were observed in 3 (5.1%) patients from the linear group only, including 1 EJ anastomosis stricture, but there was no statistical significance. Conclusions: Both circular and linear stapling techniques are feasible and safe in performing intracorporeal EJ anastomosis during LTG. The linear group had shorter operative time, but there was no difference in anastomosis complications.