3篇
您的检索式：作者名="LIBERTI Leo"
|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Boceprevir or telaprevir in hepatitis C virus chronic infection:The Italian real life experience显示文摘AIM: To check the safety and efficacy of boceprevir/telaprevir with peginterferon/ribavirin for hepatitis C virus(HCV) genotype 1 in the real-world settings. METHODS: This study was a non-randomized, observational, prospective, multicenter. This study involved 47 centers in Italy. A database was prepared for the homogenous collection of the data, was used by all of the centers for data collection, and was updated continuously. All of the patients enrolled in this study were older than 18 years of age and were diagnosed with chronic infection due to HCV genotype 1. The HCV RNA testing was performed using COBAS-Taq Man2.0(Roche, LLQ 25 IU/m L). RESULTS: All consecutively treated patients were included. Forty-seven centers enrolled 834 patients as follows: Male 64%; median age 57(range 18-78), of whom 18.3% were over 65; mean body mass index 25.6(range 16-39); genotype 1b(79.4%); diagnosis of cirrhosis(38.2%); and fibrosis F3/4(71.2%). The following drugs were used: Telaprevir(66.2%) and PEG-IFN-alpha2a(67.6%). Patients were na?ve(24.4%), relapsers(30.5%), partial responders(14.8%) and null responders(30.3%). Overall, adverse events(AEs) occurred in 617 patients(73.9%) during the treatment. Anemia was the most frequent AE(52.9% of cases), especially in cirrhotic. The therapy was stopped for 14.6% of the patients because of adverse events or virological failure(15%). Sustained virological response was achieved in 62.7% of the cases, but was 43.8% in cirrhotic patients over 65 years of age. CONCLUSION: In everyday practice, triple therapy is safe but has moderate efficacy, especially for patients over 65 years of age, with advanced fibrosis, nonresponders to peginterferon + ribavirin. | Antonio Ascione Luigi Elio Adinolfi Pietro Amoroso Angelo Andriulli Orlando Armignacco Tiziana Ascione Sergio Babudieri Giorgio Barbarini Michele Brogna Francesco Cesario Vincenzo Citro Ernesto Claar Raffaele Cozzolongo Giuseppe D’Adamo Emilio D’Amico Pellegrino Dattolo Massimo De Luca Vincenzo De Maria Massimo De Siena Giuseppe De Vita Antonio Di Giacomo Rosanna De Marco Giorgio De Stefano Giulio De Stefano Sebastiano Di Salvo Raffaele Di Sarno Nunzia Farella Laura Felicioni Basilio Fimiani Luca Fontanella Giuseppe Foti Caterina Furlan Francesca Giancotti Giancarlo Giolitto Tiziana Gravina Barbara Guerrera Roberto Gulminetti Angelo Iacobellis Michele Imparato Angelo Iodice Vincenzo Iovinella Antonio Izzi Alfonso Liberti Pietro Leo Gennaro Lettieri Ileana Luppino Aldo Marrone Ettore Mazzoni Vincenzo Messina Roberto Monarca Vincenzo Narciso Lorenzo Nosotti Adriano Maria Pellicelli Alessandro Perrella Guido Piai Antonio Picardi Paola Pierri Grazia Pietromatera Francesco Resta Luca Rinaldi Mario Romano Angelo Rossini Maurizio Russello Grazia Russo Rodolfo Sacco Vincenzo Sangiovanni Antonio Schiano Antonio Sciambra Gaetano Scifo Filomena Simeone Annarita Sullo Pierluigi Tarquini Paolo Tundo Alfredo Vallone | 2016 | World Journal of Hepatology2016，8，22： | 1 |
| 2 | Edge ratio and community structure in networks 显示文摘 | Sonia Cafieri Pierre Hansen Leo Liberti | 2010 | Phys Rev E2010，81，02： | 1 |
| 3 | Community Detection with the Weighted Parsimony Criterion显示文摘Community detection in networks has been studied extensively in the last decade. Many criteria, expressing the quality of the partitions obtained, as well as a few exact algorithms and a large number of heuristics have been proposed. The parsimony criterion consists in minimizing the number of edges added or removed from the given network in order to transform it into a set of disjoint cliques.Recently Zhang, Qiu and Zhang have proposed a weighted parsimony model in which a weight coefficient is introduced to balance the numbers of inserted and deleted edges. These authors propose rules to select a good value of the coefficient, use simulated annealing to find optimal or near-optimal solutions and solve a series of real and artificial instances. In the present paper, an algorithm is proposed for solving exactly the weighted parsimony problem for all values of the parameter. This algorithm is based on iteratively solving the problem for a set of given values of the parameter using a row generation algorithm. This procedure is combined with a search procedure to find all lowest breakpoints of the value curve(i.e., the weighted sum of inserted and deleted edges). Computational results on a series of artificial and real world networks from the literature are reported. It appears that several partitions for the same network may be informative and that the set of solutions usually contains at least one intuitively appealing partition. | BETTINELLI Andrea HANSEN Pierre LIBERTI Leo | 2015 | Journal of Systems Science & Complexity2015，28，3： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员