The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Laxmi Parida: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Laxmi Parida, Naren Ramakrishnan
    Redescription Mining: Structure Theory and Algorithms. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:837-844 [Conf]
  2. J. Feng, Laxmi Parida, Ruhong Zhou
    Protein folding trajectory analysis using patterned clusters. [Citation Graph (0, 0)][DBLP]
    APBC, 2005, pp:95-104 [Conf]
  3. Matteo Comin, Laxmi Parida
    Subtle Motif Discovery for Detection of DNA Regulatory Sites. [Citation Graph (0, 0)][DBLP]
    APBC, 2007, pp:27-36 [Conf]
  4. Gad M. Landau, Laxmi Parida, Oren Weimann
    Using PQ Trees for Comparative Genomics. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:128-143 [Conf]
  5. Laxmi Parida
    Some Results on Flexible-Pattern Discovery. [Citation Graph (0, 0)][DBLP]
    CPM, 2000, pp:33-45 [Conf]
  6. Laxmi Parida, Isidore Rigoutsos, Daniel E. Platt
    An Output-Sensitive Flexible Pattern Discovery Algorithm. [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:131-142 [Conf]
  7. Davi Geiger, Krishnan Kumaran, Laxmi Parida
    Visual Organization for Figure/Ground Separation. [Citation Graph (0, 0)][DBLP]
    CVPR, 1996, pp:155-160 [Conf]
  8. Alberto Apostolico, Matteo Comin, Laxmi Parida
    Motifs in Ziv-Lempel-Welch Clef. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2004, pp:72-81 [Conf]
  9. Alberto Apostolico, Matteo Comin, Laxmi Parida
    Off-Line Compression by Extensible Motifs. [Citation Graph (0, 0)][DBLP]
    DCC, 2005, pp:450- [Conf]
  10. Alberto Apostolico, Laxmi Parida
    Compression and the Wheel of Fortune. [Citation Graph (0, 0)][DBLP]
    DCC, 2003, pp:143-152 [Conf]
  11. Laxmi Parida, Davi Geiger, Robert A. Hummel
    Kona: A Multi-junction Detector Using Minimum Description Length Principle. [Citation Graph (0, 0)][DBLP]
    EMMCVPR, 1997, pp:51-65 [Conf]
  12. Laxmi Parida
    Vinyas: An Interactive Calligraphic Type Design System. [Citation Graph (0, 0)][DBLP]
    ICCG, 1993, pp:287-299 [Conf]
  13. Alberto Apostolico, Matteo Comin, Laxmi Parida
    Conservative extraction of over-represented extensible motifs. [Citation Graph (0, 0)][DBLP]
    ISMB (Supplement of Bioinformatics), 2005, pp:9-18 [Conf]
  14. Isidore Rigoutsos, Yuan Gao, Aris Floratos, Laxmi Parida
    Building Dictionaries of 1D and 3D Motifs by Mining the Unaligned 1D Sequences of 17 Archaeal and Bacterial Genomes. [Citation Graph (0, 0)][DBLP]
    ISMB, 1999, pp:223-233 [Conf]
  15. Ravi Vijaya Satya, Amar Mukherjee, Gabriela Alexe, Laxmi Parida, Gyan Bhanot
    Constructing Near-Perfect Phylogenies with multiple homoplasy events. [Citation Graph (0, 0)][DBLP]
    ISMB (Supplement of Bioinformatics), 2006, pp:514-522 [Conf]
  16. Aris Floratos, Isidore Rigoutsos, Laxmi Parida, Gustovo Stolovitzky, Yuan Gao
    Sequence homology detection through large scale pattern discovery. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1999, pp:164-169 [Conf]
  17. S. Muthukrishnan, Laxmi Parida
    Towards constructing physical maps by optical mapping (extended abstract): an effective, simple, combinatorial approach. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1997, pp:209-219 [Conf]
  18. Laxmi Parida
    A PQ Framework for Reconstructions of Common Ancestors and Phylogeny. [Citation Graph (0, 0)][DBLP]
    Comparative Genomics, 2006, pp:141-155 [Conf]
  19. Laxmi Parida, Bud Mishra
    Partitioning K clones: hardness results and practical algorithms for the K-populations problem. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1998, pp:192-201 [Conf]
  20. Ajay K. Royyuru, Gabriela Alexe, Daniel E. Platt, Ravi Vijaya Satya, Laxmi Parida, Saharon Rosset, Gyan Bhanot
    Inferring Common Origins from mtDNA. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2006, pp:246-247 [Conf]
  21. Laxmi Parida, Isidore Rigoutsos, Aris Floratos, Daniel E. Platt, Yuan Gao
    Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:297-308 [Conf]
  22. Revital Eres, Gad M. Landau, Laxmi Parida
    A Combinatorial Approach to Automatic Discovery of Cluster-Patterns. [Citation Graph (0, 0)][DBLP]
    WABI, 2003, pp:139-150 [Conf]
  23. Laxmi Parida
    Gapped Permutation Patterns for Comparative Genomics. [Citation Graph (0, 0)][DBLP]
    WABI, 2006, pp:376-387 [Conf]
  24. Md. Enamul Karim, Laxmi Parida, Arun Lakhotia
    Using Permutation Patterns for Content-Based Phylogeny. [Citation Graph (0, 0)][DBLP]
    PRIB, 2006, pp:115-125 [Conf]
  25. Alberto Apostolico, Matteo Comin, Laxmi Parida
    Bridging Lossy and Lossless Compression by Motif Pattern Discovery. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:793-813 [Conf]
  26. Laxmi Parida, Dan Geiger
    Mass Estimation of DNA Molecules and Extraction of Ordered Restriction Maps in Optical Mapping Imagery. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:25, n:2-3, pp:295-310 [Journal]
  27. Ruhong Zhou, Laxmi Parida, Kush Kapila, Sudhir P. Mudur
    PROTERAN: animated terrain evolution for visual analysis of patterns in protein folding trajectory. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2007, v:23, n:1, pp:99-106 [Journal]
  28. Laxmi Parida, Sudhir P. Mudur
    Constraint-satisfying planar development of complex surfaces. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1993, v:25, n:4, pp:225-232 [Journal]
  29. Laxmi Parida, Sudhir P. Mudur
    Common tangents to planar parametric curves: a geometric solution. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1995, v:27, n:1, pp:41-47 [Journal]
  30. Laxmi Parida
    A computational technique for general shape deformations for use in font design. [Citation Graph (0, 0)][DBLP]
    Computers & Graphics, 1993, v:17, n:4, pp:349-356 [Journal]
  31. Laxmi Parida, Pramod Koparkar
    A closed form solution to the problem of tangential circles, lines, points with extension to 3D. [Citation Graph (0, 0)][DBLP]
    Computers & Graphics, 1991, v:15, n:1, pp:49-55 [Journal]
  32. Laxmi Parida, Bud Mishra
    Partitioning single-molecule maps into multiple populations: algorithms and probabilistic analysis. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:104, n:1-3, pp:203-227 [Journal]
  33. Aris Floratos, Isidore Rigoutsos, Laxmi Parida, Yuan Gao
    DELPHI: A pattern-based method for detecting sequence similarity. [Citation Graph (0, 0)][DBLP]
    IBM Journal of Research and Development, 2001, v:45, n:3, pp:455-474 [Journal]
  34. Daniel E. Platt, Laxmi Parida, Yuan Gao, Aris Floratos, Isidore Rigoutsos
    QSAR in grossly underdetermined systems: Opportunities and issues. [Citation Graph (0, 0)][DBLP]
    IBM Journal of Research and Development, 2001, v:45, n:3, pp:533-544 [Journal]
  35. Rohit Parikh, Laxmi Parida, Vaughan R. Pratt
    Sock Sorting: An Example of a Vague Algorithm. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2001, v:9, n:5, pp:- [Journal]
  36. Alberto Apostolico, Laxmi Parida
    Incremental Paradigms of Motif Discovery. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2004, v:11, n:1, pp:15-25 [Journal]
  37. Revital Eres, Gad M. Landau, Laxmi Parida
    Permutation Pattern Discovery in Biosequences. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2004, v:11, n:6, pp:1050-1060 [Journal]
  38. Laxmi Parida
    A Uniform Framework for Ordered Restriction Map Problems. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1998, v:5, n:4, pp:725-740 [Journal]
  39. Laxmi Parida, Aris Floratos, Isidore Rigoutsos
    An Approximation Algorithm for Alignment of Multiple Sequences using Motif Discovery. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1999, v:3, n:2-3, pp:247-275 [Journal]
  40. Tien Huynh, Isidore Rigoutsos, Laxmi Parida, Daniel E. Platt, Tetsuo Shibuya
    The web server of IBM's Bioinformatics and Pattern Discovery group. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 2003, v:31, n:13, pp:3645-3650 [Journal]
  41. Laxmi Parida, Davi Geiger, Robert A. Hummel
    Junctions: Detection, Classification, and Reconstruction. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1998, v:20, n:7, pp:687-698 [Journal]
  42. Abhijit Chattaraj, Laxmi Parida
    An inexact-suffix-tree-based algorithm for detecting extensible patterns. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:335, n:1, pp:3-14 [Journal]
  43. Laxmi Parida, Sudhir P. Mudur
    Computational methods for evaluating swept object boundaries. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1994, v:10, n:5, pp:266-276 [Journal]
  44. Md. Enamul Karim, Andrew Walenstein, Arun Lakhotia, Laxmi Parida
    Malware phylogeny generation using permutations of code. [Citation Graph (0, 0)][DBLP]
    Journal in Computer Virology, 2005, v:1, n:1-2, pp:13-23 [Journal]

  45. Combinatorics in Recombinational Population Genomics. [Citation Graph (, )][DBLP]


  46. Recombinomics: population genomics from a recombination perspective. [Citation Graph (, )][DBLP]


  47. Minimizing recombinations in consensus networks for phylogeographic studies. [Citation Graph (, )][DBLP]


  48. APBC 2010. The Eighth Asia Pacific Bioinformatics Conference Bangalore, India, 18-21 January 2010. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.327secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002