Your browser doesn't support javascript.
loading
Mostrar: 20 | 50 | 100
Resultados 1 - 5 de 5
Filtrar
1.
BMC Genomics ; 17(Suppl 10): 784, 2016 11 11.
Artigo em Inglês | MEDLINE | ID: mdl-28185563

RESUMO

BACKGROUND: Phylogenetic networks are leaf-labeled graphs used to model and display complex evolutionary relationships that do not fit a single tree. There are two classes of phylogenetic networks: Data-display networks and evolutionary networks. While data-display networks are very commonly used to explore data, they are not amenable to incorporating probabilistic models of gene and genome evolution. Evolutionary networks, on the other hand, can accommodate such probabilistic models, but they are not commonly used for exploration. RESULTS: In this work, we show how to turn evolutionary networks into a tool for statistical exploration of phylogenetic hypotheses via a novel application of Gibbs sampling. We demonstrate the utility of our work on two recently available genomic data sets, one from a group of mosquitos and the other from a group of modern birds. We demonstrate that our method allows the use of evolutionary networks not only for explicit modeling of reticulate evolutionary histories, but also for exploring conflicting treelike hypotheses. We further demonstrate the performance of the method on simulated data sets, where the true evolutionary histories are known. CONCLUSION: We introduce an approach to explore phylogenetic hypotheses over evolutionary phylogenetic networks using Gibbs sampling. The hypotheses could involve reticulate and non-reticulate evolutionary processes simultaneously as we illustrate on mosquito and modern bird genomic data sets.


Assuntos
Algoritmos , Animais , Evolução Biológica , Aves/classificação , Aves/genética , Culicidae/classificação , Culicidae/genética , Bases de Dados Genéticas , Cadeias de Markov , Método de Monte Carlo , Filogenia
2.
Crit Care Med ; 44(9): 1754-61, 2016 09.
Artigo em Inglês | MEDLINE | ID: mdl-27315192

RESUMO

OBJECTIVES: To develop computer algorithms that can recognize physiologic patterns in traumatic brain injury patients that occur in advance of intracranial pressure and partial brain tissue oxygenation crises. The automated early detection of crisis precursors can provide clinicians with time to intervene in order to prevent or mitigate secondary brain injury. DESIGN: A retrospective study was conducted from prospectively collected physiologic data. intracranial pressure, and partial brain tissue oxygenation crisis events were defined as intracranial pressure of greater than or equal to 20 mm Hg lasting at least 15 minutes and partial brain tissue oxygenation value of less than 10 mm Hg for at least 10 minutes, respectively. The physiologic data preceding each crisis event were used to identify precursors associated with crisis onset. Multivariate classification models were applied to recorded data in 30-minute epochs of time to predict crises between 15 and 360 minutes in the future. SETTING: The neurosurgical unit of Ben Taub Hospital (Houston, TX). SUBJECTS: Our cohort consisted of 817 subjects with severe traumatic brain injury. MEASUREMENTS AND MAIN RESULTS: Our algorithm can predict the onset of intracranial pressure crises with 30-minute advance warning with an area under the receiver operating characteristic curve of 0.86 using only intracranial pressure measurements and time since last crisis. An analogous algorithm can predict the start of partial brain tissue oxygenation crises with 30-minute advanced warning with an area under the receiver operating characteristic curve of 0.91. CONCLUSIONS: Our algorithms provide accurate and timely predictions of intracranial hypertension and tissue hypoxia crises in patients with severe traumatic brain injury. Almost all of the information needed to predict the onset of these events is contained within the signal of interest and the time since last crisis.


Assuntos
Lesões Encefálicas Traumáticas/complicações , Lesões Encefálicas Traumáticas/fisiopatologia , Hipóxia Encefálica/etiologia , Hipertensão Intracraniana/etiologia , Adulto , Algoritmos , Feminino , Humanos , Hipóxia Encefálica/diagnóstico , Hipertensão Intracraniana/diagnóstico , Pressão Intracraniana/fisiologia , Masculino , Pessoa de Meia-Idade , Monitorização Neurofisiológica , Valor Preditivo dos Testes , Curva ROC , Estudos Retrospectivos , Fatores de Tempo , Adulto Jovem
3.
IEEE Trans Vis Comput Graph ; 29(1): 407-417, 2023 Jan.
Artigo em Inglês | MEDLINE | ID: mdl-36166544

RESUMO

We conduct a user study to quantify and compare user performance for a value comparison task using four bar chart designs, where the bars show the mean values of data loaded progressively and updated every second (progressive bar charts). Progressive visualization divides different stages of the visualization pipeline-data loading, processing, and visualization-into iterative animated steps to limit the latency when loading large amounts of data. An animated visualization appearing quickly, unfolding, and getting more accurate with time, enables users to make early decisions. However, intermediate mean estimates are computed only on partial data and may not have time to converge to the true means, potentially misleading users and resulting in incorrect decisions. To address this issue, we propose two new designs visualizing the history of values in progressive bar charts, in addition to the use of confidence intervals. We comparatively study four progressive bar chart designs: with/without confidence intervals, and using near-history representation with/without confidence intervals, on three realistic data distributions. We evaluate user performance based on the percentage of correct answers (accuracy), response time, and user confidence. Our results show that, overall, users can make early and accurate decisions with 92% accuracy using only 18% of the data, regardless of the design. We find that our proposed bar chart design with only near-history is comparable to bar charts with only confidence intervals in performance, and the qualitative feedback we received indicates a preference for designs with history.

4.
Artigo em Inglês | MEDLINE | ID: mdl-34632445

RESUMO

OBJECTIVES: 1) To develop a cumulative perioperative model (CPM) using the hospital clinical course of abdominal surgery cancer patients that predicts 30 and 90-day mortality risk; 2) To compare the predictive ability of this model to ten existing other models. MATERIALS AND METHODS: We constructed a multivariate logistic regression model of 30 (90)-day mortality, which occurred in 106 (290) of the cases, using 13,877 major abdominal surgical cases performed at the University of Texas MD Anderson Cancer Center from January 2007 to March 2014. The model includes race, starting location (home, inpatient ward, intensive care unit or emergency center), Charlson Comorbidity Index, emergency status, ASA-PS classification, procedure, surgical Apgar score, destination after surgery (hospital ward location) and delayed intensive care unit admit within six days. We computed and compared the model mortality prediction ability (C-statistic) as we accumulated features over time. RESULTS: We were able to predict 30 (90)-day mortality with C-statistics from 0.70 (0.71) initially to 0.87 (0.84) within six days postoperatively. CONCLUSION: We achieved a high level of model discrimination. The CPM enables a continuous cumulative assessment of the patient's mortality risk, which could then be used as a decision support aid regarding patient care and treatment, potentially resulting in improved outcomes, decreased costs and more informed decisions.

5.
Artigo em Inglês | MEDLINE | ID: mdl-21393655

RESUMO

Finding structural similarities in distantly related proteins can reveal functional relationships that can not be identified using sequence comparison. Given two proteins A and B and threshold ε Å, we develop an algorithm, TRiplet-based Iterative ALignment (TRIAL) for computing the transformation of B that maximizes the number of aligned residues such that the root mean square deviation (RMSD) of the alignment is at most ε Å. Our algorithm is designed with the specific goal of effectively handling proteins with low similarity in primary structure, where existing algorithms perform particularly poorly. Experiments show that our method outperforms existing methods. TRIAL alignment brings the secondary structures of distantly related proteins to similar orientations. It also finds larger number of secondary structure matches at lower RMSD values and increased overall alignment lengths. Its classification accuracy is up to 63 percent better than other methods, including CE and DALI. TRIAL successfully aligns 83 percent of the residues from the smaller protein in reasonable time while other methods align only 29 to 65 percent of the residues for the same set of proteins.


Assuntos
Algoritmos , Biologia Computacional/métodos , Modelos Químicos , Estrutura Terciária de Proteína , Proteínas/química , Análise de Variância , Bases de Dados de Proteínas , Modelos Moleculares , Reprodutibilidade dos Testes , Alinhamento de Sequência
SELEÇÃO DE REFERÊNCIAS
DETALHE DA PESQUISA