Laxmi Parida

According to our database1, Laxmi Parida authored at least 100 papers between 1991 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Efficient Algorithms for Sequence Analysis with Entropic Profiles.
IEEE/ACM Trans. Comput. Biology Bioinform., 2018

Essential Simplices in Persistent Homology and Subtle Admixture Detection.
Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

2017
MUSE: A Multi-locus Sampling-based Epistasis Algorithm for Quantitative Genetic Trait Prediction.
Proceedings of the Biocomputing 2017: Proceedings of the Pacific Symposium, 2017

2016
MINT: Mutual Information Based Transductive Feature Selection for Genetic Trait Prediction.
IEEE/ACM Trans. Comput. Biology Bioinform., 2016

Design of the MCAW compute service for food safety bioinformatics.
IBM Journal of Research and Development, 2016

Characterizing redescriptions using persistent homology to isolate genetic pathways contributing to pathogenesis.
BMC Systems Biology, 2016

Novel applications of multitask learning and multiple output regression to multiple genetic trait prediction.
Bioinformatics, 2016

Sampling ARG of multiple populations under complex configurations of subdivision and admixture.
Bioinformatics, 2016

Host Phenotype Prediction from Differentially Abundant Microbes Using RoDEO.
Proceedings of the Computational Intelligence Methods for Bioinformatics and Biostatistics, 2016

Scalable Algorithms at Genomic Resolution to fit LD Distributions.
Proceedings of the 7th ACM International Conference on Bioinformatics, 2016

2015
SimBA: simulation algorithm to fit extant-population distributions.
BMC Bioinformatics, 2015

Topological Signatures for Population Admixture.
Proceedings of the Research in Computational Molecular Biology, 2015

MINED: An Efficient Mutual Information Based Epistasis Detection Method to Improve Quantitative Genetic Trait Prediction.
Proceedings of the Bioinformatics Research and Applications - 11th International Symposium, 2015

Host Trait Prediction of Metagenomic Data for Topology-Based Visualization.
Proceedings of the Distributed Computing and Internet Technology, 2015

Performance evaluation of different encoding strategies for quantitative genetic trait prediction.
Proceedings of the 5th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2015

Does encoding matter? A novel view on the quantitative genetic trait prediction problem.
Proceedings of the 2015 IEEE International Conference on Bioinformatics and Biomedicine, 2015

SAME: a sampling-based multi-locus epistasis algorithm for quantitative genetic trait prediction.
Proceedings of the 6th ACM Conference on Bioinformatics, 2015

2014
Irredundant tandem motifs.
Theor. Comput. Sci., 2014

Effect of sampling on the extent and accuracy of the inferred genetic history of recombining genome.
Computational Biology and Chemistry, 2014

Entropic Profiles, Maximal Motifs and the Discovery of Significant Repetitions in Genomic Sequences.
Proceedings of the Algorithms in Bioinformatics - 14th International Workshop, 2014

Best-Fit in Linear Time for Non-generative Population Simulation - (Extended Abstract).
Proceedings of the Algorithms in Bioinformatics - 14th International Workshop, 2014

Transductive HSIC Lasso.
Proceedings of the 2014 SIAM International Conference on Data Mining, 2014

IPED2: inheritance path based pedigree reconstruction algorithm for complicated pedigrees.
Proceedings of the 5th ACM Conference on Bioinformatics, 2014

2013
ICT Strategies for Bridging Biology and Precision Medicine (Dagstuhl Perspectives Workshop 13342).
Dagstuhl Reports, 2013

ICT for Bridging Biology and Medicine (Dagstuhl Perspectives Workshop 13342).
Dagstuhl Manifestos, 2013

Sum of parts is greater than the whole: inference of common genetic history of populations.
BMC Genomics, 2013

Ultrametric networks: a new tool for phylogenetic analysis.
Algorithms for Molecular Biology, 2013

Efficient in silico Chromosomal Representation of Populations via Indexing Ancestral Genomes.
Algorithms, 2013

IPED: Inheritance Path Based Pedigree Reconstruction Algorithm Using Genotype Data.
Proceedings of the Research in Computational Molecular Biology, 2013

Using Random Graphs in Population Genomics.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

Genetic History of Populations: Limits to Inference.
Proceedings of the Models and Algorithms for Genome Evolution, 2013

2012
Combinatorial Pattern Matching (CPM 2010).
Inf. Comput., 2012

Structure Discovery in Biology: Motifs, Networks & Phylogenies (Dagstuhl Seminar 12291).
Dagstuhl Reports, 2012

ARG-based genome-wide analysis of cacao cultivars.
BMC Bioinformatics, 2012

Characterization and Extraction of Irredundant Tandem Motifs.
Proceedings of the String Processing and Information Retrieval, 2012

2011
A minimal descriptor of an ancestral recombinations graph.
BMC Bioinformatics, 2011

IRiS: Construction of ARG networks at genomic scales.
Bioinformatics, 2011

Experiences with mining temporal event sequences from electronic medical records: initial successes and some challenges.
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

2010
VARUN: Discovering Extensible Motifs under Saturation Constraints.
IEEE/ACM Trans. Comput. Biology Bioinform., 2010

A New Method to Reconstruct Recombination Events at a Genomic Scale.
PLoS Computational Biology, 2010

Ancestral Recombinations Graph: A Reconstructability Perspective Using Random-Graphs Framework.
Journal of Computational Biology, 2010

APBC 2010. The Eighth Asia Pacific Bioinformatics Conference Bangalore, India, 18-21 January 2010.
BMC Bioinformatics, 2010

Combinatorics in Recombinational Population Genomics.
Proceedings of the Bioinformatics Research and Applications, 6th International Symposium, 2010

10231 Abstracts Collection - Structure Discovery in Biology: Motifs, Networks & Phylogenies.
Proceedings of the Structure Discovery in Biology: Motifs, Networks & Phylogenies, 06.06., 2010

Recombinomics: population genomics from a recombination perspective.
Proceedings of the Canadian Conference on Computer Science & Software Engineering, 2010

2009
Minimizing recombinations in consensus networks for phylogeographic studies.
BMC Bioinformatics, 2009

2008
Detection of subtle variations as consensus motifs.
Theor. Comput. Sci., 2008

Motif patterns in 2D.
Theor. Comput. Sci., 2008

Estimating the Ancestral Recombinations Graph (ARG) as Compatible Networks of SNP Patterns.
Journal of Computational Biology, 2008

2007
Statistical Significance of Large Gene Clusters.
Journal of Computational Biology, 2007

Discovering Topological Motifs Using a Compact Notation.
Journal of Computational Biology, 2007

Gapped Permutation Pattern Discovery for Gene Order Comparisons.
Journal of Computational Biology, 2007

PROTERAN: animated terrain evolution for visual analysis of patterns in protein folding trajectory.
Bioinformatics, 2007

Subtle Motif Discovery for Detection of DNA Regulatory Sites.
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

2006
Using PQ Structures for Genomic Rearrangement Phylogeny.
Journal of Computational Biology, 2006

Mining, compressing and classifying with extensible motifs.
Algorithms for Molecular Biology, 2006

Gapped Permutation Patterns for Comparative Genomics.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

Inferring Common Origins from mtDNA.
Proceedings of the Research in Computational Molecular Biology, 2006

A PQ Framework for Reconstructions of Common Ancestors and Phylogeny.
Proceedings of the Comparative Genomics, 2006

Using Permutation Patterns for Content-Based Phylogeny.
Proceedings of the Pattern Recognition in Bioinformatics, International Workshop, 2006

Constructing Near-Perfect Phylogenies with multiple homoplasy events.
Proceedings of the Proceedings 14th International Conference on Intelligent Systems for Molecular Biology 2006, 2006

Bridging Lossy and Lossless Compression by Motif Pattern Discovery.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

2005
Malware phylogeny generation using permutations of code.
Journal in Computer Virology, 2005

An inexact-suffix-tree-based algorithm for detecting extensible patterns.
Theor. Comput. Sci., 2005

Combinatorial Pattern Discovery Approach for the Folding Trajectory Analysis of a β-Hairpin.
PLoS Computational Biology, 2005

Gene Proximity Analysis across Whole Genomes via PQ Trees1.
Journal of Computational Biology, 2005

Conservative extraction of over-represented extensible motifs.
Proceedings of the Proceedings Thirteenth International Conference on Intelligent Systems for Molecular Biology 2005, 2005

Off-Line Compression by Extensible Motifs.
Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

Using PQ Trees for Comparative Genomics.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

Protein folding trajectory analysis using patterned clusters.
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

Redescription Mining: Structure Theory and Algorithms.
Proceedings of the Proceedings, 2005

2004
Permutation Pattern Discovery in Biosequences.
Journal of Computational Biology, 2004

Incremental Paradigms of Motif Discovery.
Journal of Computational Biology, 2004

Motifs in Ziv-Lempel-Welch Clef.
Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003
The web server of IBM's Bioinformatics and Pattern Discovery group.
Nucleic Acids Research, 2003

A Combinatorial Approach to Automatic Discovery of Cluster-Patterns.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

Compression and the Wheel of Fortune.
Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

2001
Sock Sorting: An Example of a Vague Algorithm.
Logic Journal of the IGPL, 2001

QSAR in grossly underdetermined systems: Opportunities and issues.
IBM Journal of Research and Development, 2001

DELPHI: A pattern-based method for detecting sequence similarity.
IBM Journal of Research and Development, 2001

An Output-Sensitive Flexible Pattern Discovery Algorithm.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000
Partitioning single-molecule maps into multiple populations: algorithms and probabilistic analysis.
Discrete Applied Mathematics, 2000

Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Some Results on Flexible-Pattern Discovery.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1999
An Approximation Algorithm for Alignment of Multiple Sequences using Motif Discovery.
J. Comb. Optim., 1999

Mass Estimation of DNA Molecules and Extraction of Ordered Restriction Maps in Optical Mapping Imagery.
Algorithmica, 1999

Sequence homology detection through large scale pattern discovery.
Proceedings of the Third Annual International Conference on Research in Computational Molecular Biology, 1999

Building Dictionaries of 1D and 3D Motifs by Mining the Unaligned 1D Sequences of 17 Archaeal and Bacterial Genomes.
Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology, 1999

1998
Junctions: Detection, Classification, and Reconstruction.
IEEE Trans. Pattern Anal. Mach. Intell., 1998

A Uniform Framework for Ordered Restriction Map Problems.
Journal of Computational Biology, 1998

Partitioning K clones: hardness results and practical algorithms for the K-populations problem.
Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology, 1998

1997
Towards constructing physical maps by optical mapping (extended abstract): an effective, simple, combinatorial approach.
Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

Kona: A Multi-junction Detector Using Minimum Description Length Principle.
Proceedings of the Energy Minimization Methods in Computer Vision and Pattern Recognition, 1997

1996
Visual Organization for Figure/Ground Separation.
Proceedings of the 1996 Conference on Computer Vision and Pattern Recognition (CVPR '96), 1996

1995
Common tangents to planar parametric curves: a geometric solution.
Computer-Aided Design, 1995

1994
Computational methods for evaluating swept object boundaries.
The Visual Computer, 1994

1993
A computational technique for general shape deformations for use in font design.
Computers & Graphics, 1993

Constraint-satisfying planar development of complex surfaces.
Computer-Aided Design, 1993

Vinyas: An Interactive Calligraphic Type Design System.
Proceedings of the Graphics, Design and Visualization, Proceedings of the IFIP TC5/WG5.2/WG5.10 CSI International Conference on Computer Graphics, 1993

1991
A closed form solution to the problem of tangential circles, lines, points with extension to 3D.
Computers & Graphics, 1991


  Loading...