#### Filter Results:

- Full text PDF available (61)

#### Publication Year

1984

2017

- This year (3)
- Last 5 years (9)
- Last 10 years (31)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- László A. Székely
- Combinatorics, Probability & Computing
- 1997

We show that an old but not well-known lower bound for the crossing number of a graph yields short proofs for a number of bounds in discrete plane geometry which were considered hard before: the number of incidences among points and lines, the maximum number of unit distances among n points, the minimum number of distinct distances among n points. " A… (More)

- Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy J. Warnow
- Random Struct. Algorithms
- 1999

A phylogenetic tree, also called an ‘‘evolutionary tree,’’ is a leaf-labeled tree which represents the evolutionary history for a set of species, and the construction of such trees is a fundamental problem in biology. Here we address the issue of how many sequence sites are required in order to recover the tree with high probability when the sites evolve… (More)

- Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy J. Warnow
- Theor. Comput. Sci.
- 1999

- Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy J. Warnow
- ICALP
- 1997

The construction of evolutionary trees is a fundamental problem in biology, and yet methods for reconstructing evolutionary trees are not reliable when it comes to inferring accurate topologies of large divergent evolutionary trees from realistic length sequences. We address this problem and present a new polynomial time algorithm for reconstructing… (More)

- Igor B Rogozin, Kira S Makarova, +5 authors Eugene V Koonin
- Nucleic acids research
- 2002

A computational method was developed for delineating connected gene neighborhoods in bacterial and archaeal genomes. These gene neighborhoods are not typically present, in their entirety, in any single genome, but are held together by overlapping, partially conserved gene arrays. The procedure was applied to comparing the orders of orthologous genes, which… (More)

- László A. Székely
- Discrete Mathematics
- 2000

- Péter L. Erdös, László A. Székely
- Math. Program.
- 1994

A min-max theorem is developed for the multiway cut problem of edge-weighted trees. We present a polynomial time algorithm to construct an optimal dual solution, if edge weights come in unary representation. Applications to biology also require some more complex edge weights. We describe a dynarnic programming type algorithm for this more general problem… (More)

- Linyuan Lu, László A. Székely
- Electr. J. Comb.
- 2007

The Lovász Local Lemma is known to have an extension for cases where independence is missing but negative dependencies are under control. We show that this is often the case for random injections, and we provide easy-to-check conditions for the non-trivial task of verifying a negative dependency graph for random injections. As an application, we prove… (More)

- Mike A. Steel, László A. Székely, Michael D. Hendy
- Journal of Computational Biology
- 1994

For a sequence of colors independently evolving on a tree under a simple Markov model, we consider conditions under which the tree can be uniquely recovered from the "sequence spectrum"-the expected frequencies of the various leaf colorations. This is relevant for phylogenetic analysis (where colors represent nucleotides or amino acids; leaves represent… (More)

- Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
- SIAM J. Comput.
- 2000

The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is close to the minimum degree and the graph is not too sparse, then the optimal number of crossings has the same order of magnitude as the optimal arrangement value times the… (More)