Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Filters

Alberto Apostolico

Showing results (1-10 of 15) with videos related to

Pageof 2
Sort By:
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology|July 30, 2010
The subsequence composition of polypeptidesAlberto Apostolico, Fabio Cunial
Algorithms for Molecular Biology : AMB|October 30, 2008
Fast algorithms for computing sequence distances by exhaustive substring compositionAlberto Apostolico, Olgert Denas
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology|April 10, 2004
Incremental paradigms of motif discoveryAlberto Apostolico, Laxmi Parida
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology|June 27, 2012
Phylogeny construction with rigid gapped motifsFabio Cunial, Alberto Apostolico
Algorithms for Molecular Biology : AMB|March 25, 2011
Efficient algorithms for the discovery of gapped factorsAlberto Apostolico, Cinzia Pizzi, Esko Ukkonen
Bioinformatics (Oxford, England)|June 18, 2005
Conservative extraction of over-represented extensible motifsAlberto Apostolico, Matteo Comin, Laxmi Parida
Algorithms for Molecular Biology : AMB|May 26, 2006
Mining, compressing and classifying with extensible motifsAlberto Apostolico, Matteo Comin, Laxmi Parida
Journal of Biotechnology|August 5, 2010
Efficient tools for comparative substring analysisAlberto Apostolico, Olgert Denas, Andreas Dress
IEEE/ACM Transactions on Computational Biology and Bioinformatics|October 30, 2010
VARUN: discovering extensible motifs under saturation constraintsAlberto Apostolico, Matteo Comin, Laxmi Parida
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology|April 9, 2016
A Provably Efficient Algorithm for the k-Mismatch Average Common Substring ProblemSharma V Thankachan, Alberto Apostolico, Srinivas Aluru
Pageof 2

Showing results (1-10 of 15) with videos related to

Sort By:
Pageof 2
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology|July 30, 2010
The subsequence composition of polypeptidesAlberto Apostolico, Fabio Cunial
Algorithms for Molecular Biology : AMB|October 30, 2008
Fast algorithms for computing sequence distances by exhaustive substring compositionAlberto Apostolico, Olgert Denas
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology|April 10, 2004
Incremental paradigms of motif discoveryAlberto Apostolico, Laxmi Parida
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology|June 27, 2012
Phylogeny construction with rigid gapped motifsFabio Cunial, Alberto Apostolico
Algorithms for Molecular Biology : AMB|March 25, 2011
Efficient algorithms for the discovery of gapped factorsAlberto Apostolico, Cinzia Pizzi, Esko Ukkonen
Bioinformatics (Oxford, England)|June 18, 2005
Conservative extraction of over-represented extensible motifsAlberto Apostolico, Matteo Comin, Laxmi Parida
Algorithms for Molecular Biology : AMB|May 26, 2006
Mining, compressing and classifying with extensible motifsAlberto Apostolico, Matteo Comin, Laxmi Parida
Journal of Biotechnology|August 5, 2010
Efficient tools for comparative substring analysisAlberto Apostolico, Olgert Denas, Andreas Dress
IEEE/ACM Transactions on Computational Biology and Bioinformatics|October 30, 2010
VARUN: discovering extensible motifs under saturation constraintsAlberto Apostolico, Matteo Comin, Laxmi Parida
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology|April 9, 2016
A Provably Efficient Algorithm for the k-Mismatch Average Common Substring ProblemSharma V Thankachan, Alberto Apostolico, Srinivas Aluru
Pageof 2