- Computing and Information Systems - Research Publications
Computing and Information Systems - Research Publications
Permanent URI for this collection
44 results
Filters
Reset filtersSettings
Statistics
Citations
Search Results
Now showing
1 - 10 of 44
-
ItemOn the reliability and the limits of inference of amino acid sequence alignmentsRajapaksa, S ; Sumanaweera, D ; Lesk, AM ; Allison, L ; Stuckey, PJ ; Garcia de la Banda, M ; Abramson, D ; Konagurthu, AS (OXFORD UNIV PRESS, 2022-06-24)MOTIVATION: Alignments are correspondences between sequences. How reliable are alignments of amino acid sequences of proteins, and what inferences about protein relationships can be drawn? Using techniques not previously applied to these questions, by weighting every possible sequence alignment by its posterior probability we derive a formal mathematical expectation, and develop an efficient algorithm for computation of the distance between alternative alignments allowing quantitative comparisons of sequence-based alignments with corresponding reference structure alignments. RESULTS: By analyzing the sequences and structures of 1 million protein domain pairs, we report the variation of the expected distance between sequence-based and structure-based alignments, as a function of (Markov time of) sequence divergence. Our results clearly demarcate the 'daylight', 'twilight' and 'midnight' zones for interpreting residue-residue correspondences from sequence information alone. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
-
ItemUniversal Architectural Concepts Underlying Protein Folding PatternsKonagurthu, AS ; Subramanian, R ; Allison, L ; Abramson, D ; Stuckey, PJ ; Garcia de la Banda, M ; Lesk, AM (FRONTIERS MEDIA SA, 2021-04-30)What is the architectural "basis set" of the observed universe of protein structures? Using information-theoretic inference, we answer this question with a dictionary of 1,493 substructures-called concepts-typically at a subdomain level, based on an unbiased subset of known protein structures. Each concept represents a topologically conserved assembly of helices and strands that make contact. Any protein structure can be dissected into instances of concepts from this dictionary. We dissected the Protein Data Bank and completely inventoried all the concept instances. This yields many insights, including correlations between concepts and catalytic activities or binding sites, useful for rational drug design; local amino-acid sequence-structure correlations, useful for ab initio structure prediction methods; and information supporting the recognition and exploration of evolutionary relationships, useful for structural studies. An interactive site, Proçodic, at http://lcb.infotech.monash.edu.au/prosodic (click), provides access to and navigation of the entire dictionary of concepts and their usages, and all associated information. This report is part of a continuing programme with the goal of elucidating fundamental principles of protein architecture, in the spirit of the work of Cyrus Chothia.
-
ItemNo Preview AvailableA Decomposition-Based Algorithm for the Scheduling of Open-Pit Networks over Multiple Time PeriodsBlom, M ; Pearce, A ; Stuckey, P (INFORMS (Institute for Operations Research and Management Sciences), 2016)We consider the multiple-time-period, short-term production scheduling problem for a network of multiple open-pit mines and ports. Ore produced at each mine, in each period, is transported by rail to a set of ports and blended into products for shipping. Each port forms these blends to a specification, as stipulated in contracts with downstream customers. This problem belongs to a class of multiple producer/consumer scheduling problems in which producers are able to generate a range of products, a combination of which are required by consumers to meet specified demands. In practice, short-term schedules are formed independently at each mine, tasked with achieving a grade and quality target outlined in a medium-term plan. Because of uncertainty in the data available to a medium-term planner and the dynamics of the mining environment, such targets may not be feasible in the short term. In this paper, we present an algorithm in which the grade and quality targets assigned to each mine are iteratively adapted, ensuring the satisfaction of blending constraints at each port while generating schedules for each mine that maximise resource utilisation. This paper was accepted by Yinyu Ye, optimization.
-
ItemNo Preview AvailableMulti-objective short-term production scheduling for open-pit mines: a hierarchical decomposition-based algorithmBlom, M ; Pearce, AR ; Stuckey, PJ (TAYLOR & FRANCIS LTD, 2018-12-02)This article presents a novel algorithm for solving a short-term open-pit production-scheduling problem in which several objectives, of varying priority, characterize the quality of each solution. A popular approach employs receding horizon control, dividing the horizon into N period-aggregates of increasing size (number of periods or span). An N-period mixed integer program (MIP) is solved for each period in the original horizon to incrementally construct a production schedule one period at a time. This article presents a new algorithm that, in contrast, decomposes the horizon into N period-aggregates of equal size. Given a schedule for these N periods, obtained by solving an N-period MIP, the first of these aggregates is itself decomposed into an N-period scheduling problem with guidance provided on what regions of the mine should be extracted. The performance of this hierarchical decomposition-based approach is compared with that of receding horizon control on a suite of data sets generated from an operating mine producing millions of tons of ore annually. As the number of objectives being optimized increases, the hierarchical decomposition-based algorithm outperforms receding horizon control, in a majority of instances.
-
ItemNo Preview AvailableShort-term planning for open pit mines: a reviewBlom, M ; Pearce, AR ; Stuckey, PJ (TAYLOR & FRANCIS LTD, 2019-07-04)This review examines the current state-of-the-art in short-term planning for open-pit mines, with a granularity that spans days, weeks or months, and a horizon of less than one to two years. In the academic literature, the short-term planning problem for open-pit mines has not been as widely considered as that for the medium- and long-term horizons. We highlight the differences between short- and longer term planning in terms of both the level of detail to which a mine site is modelled, and the objectives that are optimised when making decisions. We summarise the range of techniques that have been developed for generating short-term plans, capturing both mathematical programming-based methods and heuristic approaches using local-search and decomposition. We identify key challenges and future directions in which to advance the state-of-the-art in short-term planning for open-pit mines.
-
ItemExplaining circuit propagationFrancis, KG ; Stuckey, PJ (SPRINGER, 2014-01)
-
ItemSearch combinatorsSchrijvers, T ; Tack, G ; Wuille, P ; Samulowitz, H ; Stuckey, PJ (SPRINGER, 2013-04)
-
ItemSolving RCPSP/max by lazy clause generationSchutt, A ; Feydy, T ; Stuckey, PJ ; Wallace, MG (SPRINGER, 2013-06)
-
ItemSymmetries, almost symmetries, and lazy clause generationChu, G ; de la Banda, MG ; Mears, C ; Stuckey, PJ (SPRINGER, 2014-10)
-
ItemThe future of optimization technologyde la Banda, MG ; Stuckey, PJ ; Van Hentenryck, P ; Wallace, M (SPRINGER, 2014-04)