Louis V. Quintas

Learn More
We consider the problem of combining a greedy motif search algorithm [16] with a self-adapting genetic algorithm employing multiple genomic representations in order to find high scoring substring patterns of size k in a set of t DNA sequences of size n thus improving the results of a stand-alone greedy motif search. We propose using multiple genomic(More)
If there are two candidates for an elective office and 2n voters such that n vote for one candidate and n vote for the other candidate, then in how many ways can one sequentially count the votes so that a given candidate is always ahead or tied with the other candidate? This is called the Ballot Problem. Variations of this problem and algorithmic(More)