Computing and Information Systems - Research Publications

Permanent URI for this collection

http://hdl.handle.net/11343/350

Filters

2005 - 2010 20
Reset filters

Settings
Statistics
Citations
Author: Stuckey, Peter × Subject: Artificial Intelligence and Image Processing ×

Search Results

Now showing 1 - 10 of 20
  • Item
    Thumbnail Image
    Principal type inference for GHC-style multi-parameter type classes
    Sulzmann, M ; Schrijvers, T ; Stuckey, PJ ; Kobayashi, N (SPRINGER-VERLAG BERLIN, 2006)
  • Item
    Thumbnail Image
    Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
    Stuckey, PJ ; Lodi, A ; Milano, M ; Toth, P (SPRINGER-VERLAG BERLIN, 2010)
  • Item
    Thumbnail Image
    Telecommunications feature subscription as a partial order constraint problem
    CODISH, M. ; LAGOON, V. ; STUCKEY, P. (Springer Verlag, 2008)
  • Item
    Thumbnail Image
    Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization
    Bailey, J ; Stuckey, PJ ; Hermenegildo, M ; Cabeza, D (SPRINGER-VERLAG BERLIN, 2005)
  • Item
    Thumbnail Image
    Propagating Dense Systems of Integer Linear Equations
    Feydy, T ; Stuckey, PJ (ASSOC COMPUTING MACHINERY, 2007)
  • Item
    Thumbnail Image
    Propagation = Lazy Clause Generation
    OHRIMENKO, O. ; STUCKEY, P. ; CODISH, M. (Springer Verlag, 2007)
  • Item
    Thumbnail Image
    Dynamic Analysis of Bounds Versus Domain Propagation
    Schulte, C ; Stuckey, PJ ; DelaBanda, MG ; Pontelli, E (Springer, 2008-12-01)
    Constraint propagation solvers interleave propagation (removing impossible values from variable domains) with search. Previously, Schulte and Stuckey introduced the use of static analysis to determine where in a constraint program domain propagators can be replaced by more efficient bounds propagators and still ensure that the same search space is traversed. This paper introduces a dynamic yet considerably simpler approach to uncover the same information. The information is obtained by a linear time traversal of an analysis graph that straightforwardly reflects the properties of propagators implementing constraints. Experiments confirm that the simple dynamic method is efficient and that it can be used interleaved with search, taking advantage of the simplification of the constraint graph that arises from search.
  • Item
    Thumbnail Image
    Fast node overlap removal
    Dwyer, T ; Marriott, K ; Stuckey, PJ ; Healy, P ; Nikolov, NS (SPRINGER-VERLAG BERLIN, 2006)
  • Item
    Thumbnail Image
    Incremental connector routing
    Wybrow, M ; Marriott, K ; Stuckey, PJ ; Healy, P ; Nikolov, NS (SPRINGER-VERLAG BERLIN, 2006)
  • Item
    Thumbnail Image
    MUSTANG: A multiple structural alignment algorithm
    Konagurthu, AS ; Whisstock, JC ; Stuckey, PJ ; Lesk, AM (WILEY, 2006-08-15)
    Multiple structural alignment is a fundamental problem in structural genomics. In this article, we define a reliable and robust algorithm, MUSTANG (MUltiple STructural AligNment AlGorithm), for the alignment of multiple protein structures. Given a set of protein structures, the program constructs a multiple alignment using the spatial information of the C(alpha) atoms in the set. Broadly based on the progressive pairwise heuristic, this algorithm gains accuracy through novel and effective refinement phases. MUSTANG reports the multiple sequence alignment and the corresponding superposition of structures. Alignments generated by MUSTANG are compared with several handcurated alignments in the literature as well as with the benchmark alignments of 1033 alignment families from the HOMSTRAD database. The performance of MUSTANG was compared with DALI at a pairwise level, and with other multiple structural alignment tools such as POSA, CE-MC, MALECON, and MultiProt. MUSTANG performs comparably to popular pairwise and multiple structural alignment tools for closely related proteins, and performs more reliably than other multiple structural alignment methods on hard data sets containing distantly related proteins or proteins that show conformational changes.