5 citations · 7 across the 2 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015
Complexity of a Disjoint Matching Problem on Bipartite Graphs
Gregory J. Puleo
We consider the following question: given an -bigraph and a set , does contain two disjoint matchings and such that saturates and…
cs.IT2015★ 5 cited
Codes for DNA Sequence Profiles
Han Mao Kiah, Gregory J. Puleo, Olgica Milenkovic
We consider the problem of storing and retrieving information from synthetic DNA media. The mathematical basis of the problem is the construction and design of sequences that may b…