Bhaskar DasGupta

Bhaskar DasGupta is currently an Associate Professor in the Computer Science Department at University of Illinois at Chicago (UIC) and also affiliated with the Bioengineering Department at UIC. He did his Ph.D. degree from University of Minnesota in 1995, and was a Postdoctoral Fellow at DIMACS and jointly at University of Waterloo and McMaster University in Canada before he joined the Computer Science Department of camden campus of Rutgers University; in 2001, he moved to UIC. His specific research interests include application of combinatorial/geometric techniques to design efficient algorithms for computational problems in bioinformatics, systems biology, and hybrid systems; his broader research interests include designing efficient combinatorial algorithms for computationally hard problems in diverse areas in addition to bioinformatics such as computational geometry, VLSI/CAD, parallel computing, optical networks, and combinatorial auctions. His research works have been supported by numerous NSF grants. He received the prestigious NSF CAREER Award in 2004.

Biography Updated on 16 January 2008

Personal Home Page

http://www.cs.uic.edu/~dasgupta/

Articles in Scholarly Journals [Incomplete List]

  1. Set covering approach for reconstruction of sibling relationships
    Optimization Methods and Software, vol. 22, no. 1, pp. 11–24, 2007
  2. A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence
    Journal of Computational Biology, vol. 14, no. 7, pp. 927–949, 2007
  3. Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks☆
    Discrete Applied Mathematics, vol. 155, no. 6-7, pp. 733–749, 2007
  4. Topology independent protein structural alignment
    BMC Bioinformatics, vol. 8, no. 1, p. 388, 2007
  5. On constructing an optimal consensus clustering from multiple clusterings
    Information Processing Letters, vol. 104, no. 4, pp. 137–145, 2007
  6. The inverse protein folding problem on 2D and 3D lattices?
    Discrete Applied Mathematics, vol. 155, no. 6-7, pp. 719–732, 2007
  7. Algorithmic and complexity results for decompositions of biological networks into monotone subsystems
    Biosystems, vol. 90, no. 1, pp. 161–178, 2007
  8. Foreword
    Algorithmica, vol. 48, no. 4, pp. 301–301, 2007
  9. Reconstructing sibling relationships in wild populations
    Bioinformatics, vol. 23, no. 13, pp. i49–i56, 2007
  10. Motif Discoveries in Unaligned Molecular Sequences Using Self-Organizing Neural Networks
    IEEE Transactions on Neural Networks, vol. 17, no. 4, pp. 919–928, 2006
  11. Inapproximability results for the lateral gene transfer problem
    Journal of Combinatorial Optimization, vol. 11, no. 4, pp. 387–405, 2006
  12. Honey-pot constrained searching with local sensory information
    Nonlinear Analysis, vol. 65, no. 9, pp. 1773–1793, 2006
  13. Tight approximability results for test set problems in bioinformatics
    Journal of Computer and System Sciences, vol. 71, no. 2, pp. 145–162, 2005
  14. Identification of motifs with insertions and deletions in protein sequences using self-organizing neural networks?
    Neural Networks, vol. 18, no. 5-6, pp. 835–842, 2005
  15. On approximate learning by multi-layered feedforward circuits
    Theoretical Computer Science, vol. 348, no. 1, pp. 95–127, 2005
  16. DNA-BAR: distinguisher selection for DNA barcoding
    Bioinformatics, vol. 21, no. 16, pp. 3424–3426, 2005
  17. Approximation algorithms for MAX–MIN tiling
    Journal of Algorithms, 2003
  18. Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms
    SIAM Journal on Discrete Mathematics, vol. 15, no. 2, p. 252, 2002
  19. Some permutation routing algorithms for low-dimensional hypercubes
    Theoretical Computer Science, vol. 270, no. 1-2, pp. 111–124, 2002
  20. A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems
    Theoretical Computer Science, vol. 262, no. 1-2, pp. 161–189, 2001
  21. Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles
    Journal of Algorithms, vol. 41, no. 2, pp. 443–470, 2001
  22. Online real-time preemptive scheduling of jobs with deadlines on multiple machines
    Journal of Scheduling, vol. 4, no. 6, pp. 297–312, 2001
  23. Journal of Global Optimization, vol. 21, no. 4, pp. 385–396, 2001
  24. Journal of Combinatorial Optimization, vol. 4, no. 3, pp. 307–323, 2000
  25. On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees
    Algorithmica, vol. 25, no. 2-3, pp. 176–195, 1999
  26. Provably Good Algorithms for Transmission Scheduling in WDM Optical Networks
    Journal of Parallel and Distributed Computing, vol. 57, no. 3, pp. 345–357, 1999
  27. Characterizations of bipartite Steinhaus graphs
    Discrete Mathematics, vol. 199, no. 1-3, pp. 11–25, 1999
  28. On the complexity and approximation of syntenic distance
    Discrete Applied Mathematics, vol. 88, no. 1-3, pp. 59–82, 1998
  29. Complexities of efficient solutions of rectilinear polygon cover problems
    Algorithmica, vol. 17, no. 4, pp. 331–356, 1997
  30. International Journal of Computational Geometry & Applications, vol. 7, no. 5, p. 437, 1997
  31. Sample complexity for learning recurrent perceptron mappings
    IEEE Transactions on Information Theory, vol. 42, no. 5, pp. 1479–1487, 1996
  32. On the complexity of training neural networks with continuous activation functions
    IEEE Transactions on Neural Networks, vol. 6, no. 6, pp. 1490–1504, 1995
  33. An approximate algorithm for the minimal vertex nested polygon problem
    Information Processing Letters, vol. 33, no. 1, pp. 35–44, 1989