#### Filter Results:

#### Publication Year

1985

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

The prevailing view of the nuclear genetic code is that it is largely frozen and unambiguous. Flexibility in the nuclear genetic code has been demonstrated in ciliates that reassign standard stop codons to amino acids, resulting in seven variant genetic codes, including three previously undescribed ones reported here. Surprisingly, in two of these species,… (More)

- E. R. Swart, S. J. Gismondi, N. R. Swart, C. E. Bell, A. Lee
- ArXiv
- 2016

We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the n! Hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices P , such that p u,i = 1 if and only if the i th arc in a cycle enters vertex u, starting and ending at vertex n + 1. A graph instance… (More)

- S. J. Gismondi, E. R. Swart
- Math. Program.
- 2004

- E. R. Swart
- APLQ
- 1985

Linear programming problems play s prominent role in operations research and a common form of problem is as follows: maximize ctz subject to Az ~ b z~e0 where the right hand side vector b represents the maximum resource availability of people, materials, machines or time; the columns of the matrix A indicate how much of each of these resources is needed to… (More)

- S. J. Gismondi, E. R. Swart
- ArXiv
- 2017

A novel matching based heuristic algorithm designed to detect specially formulated infeasible {0, 1} IPs is presented. The algorithm's input is a set of nested doubly stochastic subsystems and a set E of instance defining variables set at zero level. The algorithm deduces additional variables at zero level until either a constraint is violated (the IP is… (More)

- ‹
- 1
- ›