| 2013 | ||
|---|---|---|
| j40 | Alberto Apostolico, Matteo Comin, Andreas W. M. Dress, Laxmi Parida: Ultrametric networks: a new tool for phylogenetic analysis. Algorithms for Molecular Biology 8: 7 (2013) | |
| c30 | Dan He, Zhanyong Wang, Buhm Han, Laxmi Parida, Eleazar Eskin: IPED: Inheritance Path Based Pedigree Reconstruction Algorithm Using Genotype Data. RECOMB 2013: 75-87 | |
| 2012 | ||
| j39 | Filippo Utro, Omar Cornejo, Donald Livingstone, Juan Motamayor, Laxmi Parida: ARG-based genome-wide analysis of cacao cultivars. BMC Bioinformatics 13(S-19): S17 (2012) | |
| j38 | ||
| c29 | Laxmi Parida, Cinzia Pizzi, Simona E. Rombo: Characterization and Extraction of Irredundant Tandem Motifs. SPIRE 2012: 385-397 | |
| i1 | Alberto Apostolico, Andreas W. M. Dress, Laxmi Parida: Structure Discovery in Biology: Motifs, Networks & Phylogenies (Dagstuhl Seminar 12291). Dagstuhl Reports 2(7): 92-117 (2012) | |
| 2011 | ||
| j37 | Asif Javed, Marc Pybus, Marta Melé, Filippo Utro, Jaume Bertranpetit, Francesc Calafell, Laxmi Parida: IRiS: Construction of ARG networks at genomic scales. Bioinformatics 27(17): 2448-2450 (2011) | |
| j36 | Laxmi Parida, Pier Palamara, Asif Javed: A minimal descriptor of an ancestral recombinations graph. BMC Bioinformatics 12(S-1): S6 (2011) | |
| c28 | Debprakash Patnaik, Patrick Butler, Naren Ramakrishnan, Laxmi Parida, Benjamin J. Keller, David A. Hanauer: Experiences with mining temporal event sequences from electronic medical records: initial successes and some challenges. KDD 2011: 360-368 | |
| 2010 | ||
| j35 | Laxmi Parida, Gene Myers: APBC 2010. The Eighth Asia Pacific Bioinformatics Conference Bangalore, India, 18-21 January 2010. BMC Bioinformatics 11(S-1): 0 (2010) | |
| j34 | Laxmi Parida: Ancestral Recombinations Graph: A Reconstructability Perspective Using Random-Graphs Framework. Journal of Computational Biology 17(10): 1345-1370 (2010) | |
| j33 | Marta Melé, Asif Javed, Marc Pybus, Francesc Calafell, Laxmi Parida, Jaume Bertranpetit: A New Method to Reconstruct Recombination Events at a Genomic Scale. PLoS Computational Biology 6(11) (2010) | |
| j32 | Alberto Apostolico, Matteo Comin, Laxmi Parida: VARUN: Discovering Extensible Motifs under Saturation Constraints. IEEE/ACM Trans. Comput. Biology Bioinform. 7(4): 752-762 (2010) | |
| c27 | Asif Javed, Laxmi Parida: Recombinomics: population genomics from a recombination perspective. C3S2E 2010: 129-137 | |
| c26 | ||
| e1 | Amihood Amir, Laxmi Parida (Eds.): Combinatorial Pattern Matching, 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010. Proceedings. Lecture Notes in Computer Science 6129, Springer 2010, isbn 978-3-642-13508-8 | |
| 2009 | ||
| j31 | Laxmi Parida, Asif Javed, Marta Melé, Francesc Calafell, Jaume Bertranpetit: Minimizing recombinations in consensus networks for phylogeographic studies. BMC Bioinformatics 10(S-1) (2009) | |
| 2008 | ||
| j30 | Laxmi Parida, Marta Melé, Francesc Calafell, Jaume Bertranpetit: Estimating the Ancestral Recombinations Graph (ARG) as Compatible Networks of SNP Patterns. Journal of Computational Biology 15(9): 1133-1153 (2008) | |
| j29 | Alberto Apostolico, Laxmi Parida, Simona E. Rombo: Motif patterns in 2D. Theor. Comput. Sci. 390(1): 40-55 (2008) | |
| j28 | Matteo Comin, Laxmi Parida: Detection of subtle variations as consensus motifs. Theor. Comput. Sci. 395(2-3): 158-170 (2008) | |
| 2007 | ||
| j27 | Ruhong Zhou, Laxmi Parida, Kush Kapila, Sudhir P. Mudur: PROTERAN: animated terrain evolution for visual analysis of patterns in protein folding trajectory. Bioinformatics 23(1): 99-106 (2007) | |
| j26 | Laxmi Parida: Gapped Permutation Pattern Discovery for Gene Order Comparisons. Journal of Computational Biology 14(1): 45-55 (2007) | |
| j25 | Laxmi Parida: Discovering Topological Motifs Using a Compact Notation. Journal of Computational Biology 14(3): 300-323 (2007) | |
| j24 | Laxmi Parida: Statistical Significance of Large Gene Clusters. Journal of Computational Biology 14(9): 1145-1159 (2007) | |
| c25 | Matteo Comin, Laxmi Parida: Subtle Motif Discovery for Detection of DNA Regulatory Sites. APBC 2007: 27-36 | |
| 2006 | ||
| j23 | Alberto Apostolico, Matteo Comin, Laxmi Parida: Mining, compressing and classifying with extensible motifs. Algorithms for Molecular Biology 1 (2006) | |
| j22 | Laxmi Parida: Using PQ Structures for Genomic Rearrangement Phylogeny. Journal of Computational Biology 13(10): 1685-1700 (2006) | |
| c24 | Alberto Apostolico, Matteo Comin, Laxmi Parida: Bridging Lossy and Lossless Compression by Motif Pattern Discovery. GTIT-C 2006: 793-813 | |
| c23 | Ravi Vijaya Satya, Amar Mukherjee, Gabriela Alexe, Laxmi Parida, Gyan Bhanot: Constructing Near-Perfect Phylogenies with multiple homoplasy events. ISMB (Supplement of Bioinformatics) 2006: 514-522 | |
| c22 | Md. Enamul Karim, Laxmi Parida, Arun Lakhotia: Using Permutation Patterns for Content-Based Phylogeny. PRIB 2006: 115-125 | |
| c21 | Laxmi Parida: A PQ Framework for Reconstructions of Common Ancestors and Phylogeny. Comparative Genomics 2006: 141-155 | |
| c20 | Ajay K. Royyuru, Gabriela Alexe, Daniel E. Platt, Ravi Vijaya Satya, Laxmi Parida, Saharon Rosset, Gyan Bhanot: Inferring Common Origins from mtDNA. RECOMB 2006: 246-247 | |
| c19 | ||
| 2005 | ||
| j21 | Alberto Apostolico, Matteo Comin, Laxmi Parida: Bridging Lossy and Lossless Compression by Motif Pattern Discovery. Electronic Notes in Discrete Mathematics 21: 219-225 (2005) | |
| j20 | Gad M. Landau, Laxmi Parida, Oren Weimann: Gene Proximity Analysis across Whole Genomes via PQ Trees1. Journal of Computational Biology 12(10): 1289-1306 (2005) | |
| j19 | Laxmi Parida, Ruhong Zhou: Combinatorial Pattern Discovery Approach for the Folding Trajectory Analysis of a β-Hairpin. PLoS Computational Biology 1(1) (2005) | |
| j18 | Abhijit Chattaraj, Laxmi Parida: An inexact-suffix-tree-based algorithm for detecting extensible patterns. Theor. Comput. Sci. 335(1): 3-14 (2005) | |
| j17 | Md. Enamul Karim, Andrew Walenstein, Arun Lakhotia, Laxmi Parida: Malware phylogeny generation using permutations of code. Journal in Computer Virology 1(1-2): 13-23 (2005) | |
| c18 | Laxmi Parida, Naren Ramakrishnan: Redescription Mining: Structure Theory and Algorithms. AAAI 2005: 837-844 | |
| c17 | J. Feng, Laxmi Parida, Ruhong Zhou: Protein folding trajectory analysis using patterned clusters. APBC 2005: 95-104 | |
| c16 | Gad M. Landau, Laxmi Parida, Oren Weimann: Using PQ Trees for Comparative Genomics. CPM 2005: 128-143 | |
| c15 | Alberto Apostolico, Matteo Comin, Laxmi Parida: Off-Line Compression by Extensible Motifs. DCC 2005: 450 | |
| c14 | Alberto Apostolico, Matteo Comin, Laxmi Parida: Conservative extraction of over-represented extensible motifs. ISMB (Supplement of Bioinformatics) 2005: 9-18 | |
| 2004 | ||
| j16 | Alberto Apostolico, Laxmi Parida: Incremental Paradigms of Motif Discovery. Journal of Computational Biology 11(1): 15-25 (2004) | |
| j15 | Revital Eres, Gad M. Landau, Laxmi Parida: Permutation Pattern Discovery in Biosequences. Journal of Computational Biology 11(6): 1050-1060 (2004) | |
| c13 | Alberto Apostolico, Matteo Comin, Laxmi Parida: Motifs in Ziv-Lempel-Welch Clef. Data Compression Conference 2004: 72-81 | |
| 2003 | ||
| j14 | Tien Huynh, Isidore Rigoutsos, Laxmi Parida, Daniel E. Platt, Tetsuo Shibuya: The web server of IBM's Bioinformatics and Pattern Discovery group. Nucleic Acids Research 31(13): 3645-3650 (2003) | |
| c12 | ||
| c11 | Revital Eres, Gad M. Landau, Laxmi Parida: A Combinatorial Approach to Automatic Discovery of Cluster-Patterns. WABI 2003: 139-150 | |
| 2001 | ||
| j13 | Aris Floratos, Isidore Rigoutsos, Laxmi Parida, Yuan Gao: DELPHI: A pattern-based method for detecting sequence similarity. IBM Journal of Research and Development 45(3): 455-474 (2001) | |
| j12 | Daniel E. Platt, Laxmi Parida, Yuan Gao, Aris Floratos, Isidore Rigoutsos: QSAR in grossly underdetermined systems: Opportunities and issues. IBM Journal of Research and Development 45(3): 533-544 (2001) | |
| j11 | Rohit Parikh, Laxmi Parida, Vaughan R. Pratt: Sock Sorting: An Example of a Vague Algorithm. Logic Journal of the IGPL 9(5): 687-692 (2001) | |
| c10 | Laxmi Parida, Isidore Rigoutsos, Daniel E. Platt: An Output-Sensitive Flexible Pattern Discovery Algorithm. CPM 2001: 131-142 | |
| 2000 | ||
| j10 | Laxmi Parida, Bud Mishra: Partitioning single-molecule maps into multiple populations: algorithms and probabilistic analysis. Discrete Applied Mathematics 104(1-3): 203-227 (2000) | |
| c9 | ||
| c8 | 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. SODA 2000: 297-308 | |
| 1999 | ||
| j9 | Laxmi Parida, Dan Geiger: Mass Estimation of DNA Molecules and Extraction of Ordered Restriction Maps in Optical Mapping Imagery. Algorithmica 25(2-3): 295-310 (1999) | |
| j8 | Laxmi Parida, Aris Floratos, Isidore Rigoutsos: An Approximation Algorithm for Alignment of Multiple Sequences using Motif Discovery. J. Comb. Optim. 3(2-3): 247-275 (1999) | |
| c7 | 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. ISMB 1999: 223-233 | |
| c6 | Aris Floratos, Isidore Rigoutsos, Laxmi Parida, Gustovo Stolovitzky, Yuan Gao: Sequence homology detection through large scale pattern discovery. RECOMB 1999: 164-169 | |
| 1998 | ||
| j7 | Laxmi Parida: A Uniform Framework for Ordered Restriction Map Problems. Journal of Computational Biology 5(4): 725-739 (1998) | |
| j6 | Laxmi Parida, Davi Geiger, Robert A. Hummel: Junctions: Detection, Classification, and Reconstruction. IEEE Trans. Pattern Anal. Mach. Intell. 20(7): 687-698 (1998) | |
| c5 | Laxmi Parida, Bud Mishra: Partitioning K clones: hardness results and practical algorithms for the K-populations problem. RECOMB 1998: 192-201 | |
| 1997 | ||
| c4 | Laxmi Parida, Davi Geiger, Robert A. Hummel: Kona: A Multi-junction Detector Using Minimum Description Length Principle. EMMCVPR 1997: 51-65 | |
| c3 | S. Muthukrishnan, Laxmi Parida: Towards constructing physical maps by optical mapping (extended abstract): an effective, simple, combinatorial approach. RECOMB 1997: 209-219 | |
| 1996 | ||
| c2 | Davi Geiger, Krishnan Kumaran, Laxmi Parida: Visual Organization for Figure/Ground Separation. CVPR 1996: 155-160 | |
| 1995 | ||
| j5 | Laxmi Parida, Sudhir P. Mudur: Common tangents to planar parametric curves: a geometric solution. Computer-Aided Design 27(1): 41-47 (1995) | |
| 1994 | ||
| j4 | Laxmi Parida, Sudhir P. Mudur: Computational methods for evaluating swept object boundaries. The Visual Computer 10(5): 266-276 (1994) | |
| 1993 | ||
| j3 | Laxmi Parida, Sudhir P. Mudur: Constraint-satisfying planar development of complex surfaces. Computer-Aided Design 25(4): 225-232 (1993) | |
| j2 | Laxmi Parida: A computational technique for general shape deformations for use in font design. Computers & Graphics 17(4): 349-356 (1993) | |
| c1 | ||
| 1991 | ||
| j1 | Laxmi Parida, Pramod Koparkar: A closed form solution to the problem of tangential circles, lines, points with extension to 3D. Computers & Graphics 15(1): 49-55 (1991) | |
Colors in the list of coauthors
Last update Tue May 21 13:41:34 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page