Search research articles
Contact Us
Filters
Showing results (1-10 of 128) with videos related to
Page
of 13
Sort By:
Methods in Molecular Biology (Clifton, N.J.)
|
March 9, 2012
Nonredundant representation of ancestral recombinations graphs
Laxmi Parida
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
March 27, 2007
Gapped permutation pattern discovery for gene order comparisons
Laxmi Parida
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
January 24, 2007
Using PQ structures for genomic rearrangement phylogeny
Laxmi Parida
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
June 15, 2007
Discovering topological motifs using a compact notation
Laxmi Parida
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
October 27, 2010
Ancestral recombinations graph: a reconstructability perspective using random-graphs framework
Laxmi Parida
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
November 14, 2007
Statistical significance of large gene clusters
Laxmi Parida
BMC Bioinformatics
|
April 19, 2015
SimBA: simulation algorithm to fit extant-population distributions
Laxmi Parida, Niina Haiminen
Plos Computational Biology
|
August 17, 2005
Combinatorial pattern discovery approach for the folding trajectory analysis of a beta-hairpin
Laxmi Parida, Ruhong Zhou
Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing
|
November 30, 2016
MUSE: A MULTI-LOCUS SAMPLING-BASED EPISTASIS ALGORITHM FOR QUANTITATIVE GENETIC TRAIT PREDICTION
Dan He, Laxmi Parida
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
April 10, 2004
Incremental paradigms of motif discovery
Alberto Apostolico, Laxmi Parida
Page
of 13
Search research articles
Search
Showing results (1-10 of 128) with videos related to
Sort By:
Page
of 13
Methods in Molecular Biology (Clifton, N.J.)
|
March 9, 2012
Nonredundant representation of ancestral recombinations graphs
Laxmi Parida
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
March 27, 2007
Gapped permutation pattern discovery for gene order comparisons
Laxmi Parida
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
January 24, 2007
Using PQ structures for genomic rearrangement phylogeny
Laxmi Parida
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
June 15, 2007
Discovering topological motifs using a compact notation
Laxmi Parida
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
October 27, 2010
Ancestral recombinations graph: a reconstructability perspective using random-graphs framework
Laxmi Parida
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
November 14, 2007
Statistical significance of large gene clusters
Laxmi Parida
BMC Bioinformatics
|
April 19, 2015
SimBA: simulation algorithm to fit extant-population distributions
Laxmi Parida, Niina Haiminen
Plos Computational Biology
|
August 17, 2005
Combinatorial pattern discovery approach for the folding trajectory analysis of a beta-hairpin
Laxmi Parida, Ruhong Zhou
Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing
|
November 30, 2016
MUSE: A MULTI-LOCUS SAMPLING-BASED EPISTASIS ALGORITHM FOR QUANTITATIVE GENETIC TRAIT PREDICTION
Dan He, Laxmi Parida
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|
April 10, 2004
Incremental paradigms of motif discovery
Alberto Apostolico, Laxmi Parida
Page
of 13