Mining HLA Patterns Explaining Liver Diseases
Published 1 January 2006
Michele Berlingerio, Francesco Bonchi, Silvia Chelazzi, Michele Curcio, Fosca Giannotti, Fabrizio Scatena
Citations4
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
It is important to assess the existence of associations between haplotypic settings (possibly mixed with clinical and demographical information) and hepatic cirrhosis and algorithms developed for frequent patterns discovery can help to discover interesting haplotypesic patterns beyond traditional analysis methods capabilities.
Abstract
HumanLeukocyteAntigens (HLA), also known as histocompatibility antigens, are molecules found on all nucleated cells in the body. Histocompatibility antigens help the immune system to recognize whether or not a cell is foreign to the body, hence the success of an organ transplantation is strongly connected to the HLA systems of the donor-recipient pair. Beyond this important role, the HLA system seems to influence also the clinical course of hepatic cirrhosis, both on viral and autoimmune basis. However, not only different antigens have different importance w.r.t. hepatic cirrhosis, but, to make things more complicated, other not yet well characterized factors could play an important role. It is thus important to assess the existence of associations between haplotypic settings (possibly mixed with clinical and demographical information) and hepatic cirrhosis.Algorithms developed for frequent patterns discovery can help us achieve this goal. Thanks to their ability in handling a very large number of variables and the associated exponential search space, such techniques can discover interesting haplotypic patterns beyond traditional analysis methods capabilities.
Keywords
MedicineBiochemistry, Genetics and Molecular Biology
Mining association rules between sets of items in large databases
14,720 Citations1993Rakesh Agrawal, Tomasz Imieliński +1 more
An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
ACM SIGMOD RecordMining frequent patterns without candidate generation
6,360 Citations2000Jiawei Han, Jian Pei +1 more
Mining frequent patterns without candidate generation
3,195 Citations2000Jiawei Han, Jian Pei +1 more
This study proposes a novel frequent pattern tree (FP-tree) structure, which is an extended prefix-tree structure for storing compressed, crucial information about frequent patterns, and develops an efficient FP-tree-based mining method, FP-growth, for mining the complete set of frequent patterns by pattern fragment growth.
Integrating classification and association rule mining
2,223 Citations1998Bing Liu, Wynne Hsu +1 more
The integration is done by focusing on mining a special subset of association rules, called class association rules (CARs), and shows that the classifier built this way is more accurate than that produced by the state-of-the-art classification system C4.5.
Lecture notes in computer scienceDiscovering Frequent Closed Itemsets for Association Rules
1,361 Citations1999Nicolas Pasquier, Yves Bastide +2 more
This paper proposes a new algorithm, called A-Close, using a closure mechanism to find frequent closed itemsets, and shows that this approach is very valuable for dense and/or correlated data that represent an important part of existing databases.
CMAR: accurate and efficient classification based on multiple class-association rules
1,209 Citations2002Wenmin Li, Jiawei Han +1 more
The authors propose a new associative classification method, CMAR, i.e., Classification based on Multiple Association Rules, which extends an efficient frequent pattern mining method, FP-growth, constructs a class distribution-associated FP-tree, and mines large databases efficiently.
CHARM: An Efficient Algorithm for Closed Itemset Mining
896 Citations2002Mohammed J. Zaki, Ching-Jui Hsiao
CHARM is an efficient algorithm for mining all frequent closed itemsets that enumerates closed sets using a dual itemset-tidset search tree, using an efficient hybrid search that skips many levels, and uses a technique called diffsets to reduce the memory footprint of intermediate computations.
Molecular Biology and EvolutionInference of haplotypes from PCR-amplified samples of diploid populations.
767 Citations1990Andrew G. Clark
Details of the algorithm for extracting allelic sequences from population samples, along with some population-genetic considerations that influence the likelihood for success of the method, are presented here.
IEEE Transactions on Knowledge and Data EngineeringEfficient algorithms for mining closed itemsets and their lattice structure
669 Citations2005Mohammed J. Zaki, C.-J. Hsiao
CHARM is an efficient algorithm for mining all frequent closed itemsets using a dual itemset-tidset search tree, using an efficient hybrid search that skips many levels, and uses a technique called diffsets to reduce the memory footprint of intermediate computations.
CLOSET+
582 Citations2003Jianyong Wang, Jiawei Han +1 more
Tissue AntigensBehçet’s disease, the Silk Road and HLA‐B51: historical and geographical perspectives
453 Citations1999David H. Verity, Jane Marr +3 more
The history of Behçet's disease since its first description by Hippocrates, the development of the trading routes collectively known as the Silk Road and the effect of population movement on the distribution of HLA-B51 are reviewed, suggesting a genetic risk that migrated in parallel with population movement between the Mediterranean and Asia.
New England Journal of MedicineAssociation between an MHC Class II Allele and Clearance of Hepatitis B Virus in the Gambia
439 Citations1995Mark Thursz, Dominic Kwiatkowski +4 more
The MHC class II allele DRB1*1302 was associated with protection against persistent HBV infection among both children and adults in the Gambia and possible associations with HLA class I antigens found in children were not supported by the data on adults.
Circulation ResearchAngiopoietin-1 Reduces VEGF-Stimulated Leukocyte Adhesion to Endothelial Cells by Reducing ICAM-1, VCAM-1, and E-Selectin Expression
373 Citations2001Injune Kim, Sang-Ok Moon +3 more
It is demonstrated that Ang1 counteracts VEGF-induced inflammation by reducing VEGf-induced endothelial adhesiveness, and reduces VEGFs' leukocyte adhesion to HUVECs.
The LancetInfluence of MHC class II genotype on outcome of infection with hepatitis C virus
286 Citations1999Mark Thursz, Rhiannon Yallop +3 more
No significant associations were found between MHC class II alleles and severe histological injury or response to interferon therapy or susceptibility to persistent HCV infection.
Journal of Computational BiologyInference of Haplotypes from Samples of Diploid Populations: Complexity and Algorithms
157 Citations2001Dan Gusfield
The problem is NP-hard and, in fact, Max-SNP complete; it is shown that the reduction creates problem instances conforming to a severe restriction believed to hold in real data; and an approach based on that operation and (integer) linear programming works quickly and correctly on simulated data.
MaPle: a fast algorithm for maximal pattern-based clustering
103 Citations2004Jian Pei, Xiaoling Zhang +3 more
MaPle, an efficient and scalable mining algorithm that conducts a depth-first, divide-and-conquer search and prunes unnecessary branches smartly, shows that maximal pattern-based clustering is effective and reduces the number of clusters substantially.
ImmunogeneticsMIC-A allele profiles and HLA class I associations in Behçet's disease
86 Citations1999Graham R. Wallace, David H. Verity +12 more
Frequent-pattern based iterative projected clustering
75 Citations2004Man Lung Yiu, Nikos Mamoulis
This work proposes a methodology for finding projected clusters by mining frequent itemsets and presents heuristics that improve its quality and evaluates the techniques with synthetic and real data.
BloodMixed blood chimerism in T cell-depleted bone marrow transplant recipients: evaluation using DNA polymorphisms
65 Citations1987Stéphane Bretagne, Michel Vidaud +6 more
The hypothesis that transplanted bone marrow T cells may help to maintain engraftment by eliminating host cells that can cause graft failure is supported.
DCI_Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets
56 Citations2004Claudio Lucchese, Salvatore Orlando +1 more
This paper proposes a general technique for promptly detecting and discarding duplicate closed itemsets, without the need of keeping in the main memory the whole set of closed patterns.
A practical algorithm for optimal inference of haplotypes from diploid populations.
44 Citations2000Dan Gusfield
This paper considers the question of whether an efficient, deterministic variant of a particular non-deterministic inference algorithm can be obtained to optimize the obtained inferences, and presents a practical approach based on (integer) linear programming.
Tissue AntigensMicrogeographic variation of HLA‐A, ‐B, and ‐DR haplotype frequencies in Tuscany, Italy: implications for recruitment of bone marrow donors
9 Citations2004Fabio Marroni, Michele Curcio +5 more
Knowing the genetic structure of the population at a microgeographic level may be useful in directing the search of specific bone marrow donors in a subregion of Tuscany (Italy).