Searching for the Multiple Longest Common Subsequences (MLCS) of multiple sequences is a classical NP-hard problem, which has been used in many applications. One of the most effective exact approaches for the MLCS problem is based on dominant point graph, which is a kind of directed acyclic graph (DAG). However, the time and space efficiency of the leading dominant point graph based approaches ...

Although bioethics societies are developing standards for clinical ethicists and a code of ethics, they have been castigated in this journal as "a moral, if not an ethics, disaster" for not having completed this task. Compared with the development of codes of ethics and educational standards in law and medicine, however, the pace of professionalization in bioethics appears appropriate. Assessed...

INTRODUCTION The aim of our study is to search for the existence of neuropathy, dysautonomia and to identify the correlations of sickness level of patients with Obstructive Sleep Apnea Syndrome (OSAS). METHODS The research is based on the real cases at Dokuz Eylul University of Medicine Sleep and Epilepsy Center, observed during September 2008-May 2009. The patients were selected by polysomno...

We consider fair allocation of indivisible items in a model with goods, chores, and copies, as unified framework for studying: (1) the existence EFX other solution concepts goods copies; (2) chores. establish tight relation between these issues via two conceptual contributions: First, refinement envy-based fairness notions that we term envy without commons (denoted WC when applied to EFX). Seco...

We describe an algorithm for computing points o = io < ii < • • • < xjt < Zfc+i = b which solve certain nonlinear systems d(z,_i,xt) = d(i,,x,+i), i = 1,... ,fc. In contrast to Newton-type methods, the algorithm converges when starting with arbitrary points. The method is applied to compute best piecewise polynomial approximations with free knots. The advantage is that in the starting phase onl...