2008 | ||
---|---|---|
53 | EE | 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) |
52 | EE | Alberto Apostolico, Laxmi Parida, Simona E. Rombo: Motif patterns in 2D. Theor. Comput. Sci. 390(1): 40-55 (2008) |
51 | EE | Matteo Comin, Laxmi Parida: Detection of subtle variations as consensus motifs. Theor. Comput. Sci. 395(2-3): 158-170 (2008) |
2007 | ||
50 | EE | Matteo Comin, Laxmi Parida: Subtle Motif Discovery for Detection of DNA Regulatory Sites. APBC 2007: 27-36 |
49 | EE | 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) |
48 | EE | Laxmi Parida: Gapped Permutation Pattern Discovery for Gene Order Comparisons. Journal of Computational Biology 14(1): 45-55 (2007) |
47 | EE | Laxmi Parida: Discovering Topological Motifs Using a Compact Notation. Journal of Computational Biology 14(3): 300-323 (2007) |
46 | EE | Laxmi Parida: Statistical Significance of Large Gene Clusters. Journal of Computational Biology 14(9): 1145-1159 (2007) |
2006 | ||
45 | EE | Laxmi Parida: A PQ Framework for Reconstructions of Common Ancestors and Phylogeny. Comparative Genomics 2006: 141-155 |
44 | EE | Alberto Apostolico, Matteo Comin, Laxmi Parida: Bridging Lossy and Lossless Compression by Motif Pattern Discovery. GTIT-C 2006: 793-813 |
43 | EE | 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 |
42 | EE | Md. Enamul Karim, Laxmi Parida, Arun Lakhotia: Using Permutation Patterns for Content-Based Phylogeny. PRIB 2006: 115-125 |
41 | EE | 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 |
40 | EE | Laxmi Parida: Gapped Permutation Patterns for Comparative Genomics. WABI 2006: 376-387 |
39 | EE | Laxmi Parida: Using PQ Structures for Genomic Rearrangement Phylogeny. Journal of Computational Biology 13(10): 1685-1700 (2006) |
2005 | ||
38 | Laxmi Parida, Naren Ramakrishnan: Redescription Mining: Structure Theory and Algorithms. AAAI 2005: 837-844 | |
37 | EE | J. Feng, Laxmi Parida, Ruhong Zhou: Protein folding trajectory analysis using patterned clusters. APBC 2005: 95-104 |
36 | EE | Gad M. Landau, Laxmi Parida, Oren Weimann: Using PQ Trees for Comparative Genomics. CPM 2005: 128-143 |
35 | EE | Alberto Apostolico, Matteo Comin, Laxmi Parida: Off-Line Compression by Extensible Motifs. DCC 2005: 450 |
34 | EE | Alberto Apostolico, Matteo Comin, Laxmi Parida: Conservative extraction of over-represented extensible motifs. ISMB (Supplement of Bioinformatics) 2005: 9-18 |
33 | EE | Alberto Apostolico, Matteo Comin, Laxmi Parida: Bridging Lossy and Lossless Compression by Motif Pattern Discovery. Electronic Notes in Discrete Mathematics 21: 219-225 (2005) |
32 | EE | 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) |
31 | EE | 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) |
30 | EE | Abhijit Chattaraj, Laxmi Parida: An inexact-suffix-tree-based algorithm for detecting extensible patterns. Theor. Comput. Sci. 335(1): 3-14 (2005) |
2004 | ||
29 | EE | Alberto Apostolico, Matteo Comin, Laxmi Parida: Motifs in Ziv-Lempel-Welch Clef. Data Compression Conference 2004: 72-81 |
28 | EE | Alberto Apostolico, Laxmi Parida: Incremental Paradigms of Motif Discovery. Journal of Computational Biology 11(1): 15-25 (2004) |
27 | EE | Revital Eres, Gad M. Landau, Laxmi Parida: Permutation Pattern Discovery in Biosequences. Journal of Computational Biology 11(6): 1050-1060 (2004) |
2003 | ||
26 | EE | Alberto Apostolico, Laxmi Parida: Compression and the Wheel of Fortune. DCC 2003: 143-152 |
25 | EE | Revital Eres, Gad M. Landau, Laxmi Parida: A Combinatorial Approach to Automatic Discovery of Cluster-Patterns. WABI 2003: 139-150 |
24 | 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) | |
2001 | ||
23 | EE | Laxmi Parida, Isidore Rigoutsos, Daniel E. Platt: An Output-Sensitive Flexible Pattern Discovery Algorithm. CPM 2001: 131-142 |
22 | EE | 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) |
21 | EE | 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) |
20 | EE | Rohit Parikh, Laxmi Parida, Vaughan R. Pratt: Sock Sorting: An Example of a Vague Algorithm. Logic Journal of the IGPL 9(5): (2001) |
2000 | ||
19 | EE | Laxmi Parida: Some Results on Flexible-Pattern Discovery. CPM 2000: 33-45 |
18 | EE | 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 |
17 | Laxmi Parida, Bud Mishra: Partitioning single-molecule maps into multiple populations: algorithms and probabilistic analysis. Discrete Applied Mathematics 104(1-3): 203-227 (2000) | |
1999 | ||
16 | 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 | |
15 | EE | Aris Floratos, Isidore Rigoutsos, Laxmi Parida, Gustovo Stolovitzky, Yuan Gao: Sequence homology detection through large scale pattern discovery. RECOMB 1999: 164-169 |
14 | EE | 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) |
13 | 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) | |
1998 | ||
12 | EE | Laxmi Parida, Bud Mishra: Partitioning K clones: hardness results and practical algorithms for the K-populations problem. RECOMB 1998: 192-201 |
11 | EE | Laxmi Parida, Davi Geiger, Robert A. Hummel: Junctions: Detection, Classification, and Reconstruction. IEEE Trans. Pattern Anal. Mach. Intell. 20(7): 687-698 (1998) |
10 | Laxmi Parida: A Uniform Framework for Ordered Restriction Map Problems. Journal of Computational Biology 5(4): 725-740 (1998) | |
1997 | ||
9 | Laxmi Parida, Davi Geiger, Robert A. Hummel: Kona: A Multi-junction Detector Using Minimum Description Length Principle. EMMCVPR 1997: 51-65 | |
8 | EE | S. Muthukrishnan, Laxmi Parida: Towards constructing physical maps by optical mapping (extended abstract): an effective, simple, combinatorial approach. RECOMB 1997: 209-219 |
1996 | ||
7 | EE | Davi Geiger, Krishnan Kumaran, Laxmi Parida: Visual Organization for Figure/Ground Separation. CVPR 1996: 155-160 |
1995 | ||
6 | EE | Laxmi Parida, Sudhir P. Mudur: Common tangents to planar parametric curves: a geometric solution. Computer-Aided Design 27(1): 41-47 (1995) |
1994 | ||
5 | Laxmi Parida, Sudhir P. Mudur: Computational methods for evaluating swept object boundaries. The Visual Computer 10(5): 266-276 (1994) | |
1993 | ||
4 | Laxmi Parida: Vinyas: An Interactive Calligraphic Type Design System. ICCG 1993: 287-299 | |
3 | EE | Laxmi Parida, Sudhir P. Mudur: Constraint-satisfying planar development of complex surfaces. Computer-Aided Design 25(4): 225-232 (1993) |
2 | EE | Laxmi Parida: A computational technique for general shape deformations for use in font design. Computers & Graphics 17(4): 349-356 (1993) |
1991 | ||
1 | EE | 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) |