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

Solon P Pissis

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

Pageof 3
Sort By:
BMC Bioinformatics|July 10, 2014
MoTeX-II: structured MoTif eXtraction from large-scale datasetsSolon P Pissis
IEEE Journal of Biomedical and Health Informatics|November 19, 2021
Clustering Demographics and Sequences of Diagnosis CodesHaodi Zhong, Grigorios Loukides, Solon P Pissis
BMC Genomics|January 16, 2017
MARS: improving multiple circular sequence alignment using refined sequencesLorraine A K Ayad, Solon P Pissis
Algorithms for Molecular Biology : AMB|September 16, 2014
Optimal computation of all tandem repeats in a weighted sequenceCarl Barton, Costas S Iliopoulos, Solon P Pissis
Bioinformatics (Oxford, England)|April 14, 2017
emMAW: computing minimal absent words in external memoryAlice Héliou, Solon P Pissis, Simon J Puglisi
Algorithms for Molecular Biology : AMB|March 25, 2014
Fast algorithms for approximate circular string matchingCarl Barton, Costas S Iliopoulos, Solon P Pissis
Bioinformatics Advances|August 25, 2023
Seedability: optimizing alignment parameters for sensitive sequence comparisonLorraine A K Ayad, Rayan Chikhi, Solon P Pissis
Bioinformatics (Oxford, England)|November 14, 2018
CNEFinder: finding conserved non-coding elements in genomesLorraine A K Ayad, Solon P Pissis, Dimitris Polychronopoulos
Bioinformatics (Oxford, England)|December 25, 2019
SMART: SuperMaximal approximate repeats toolLorraine A K Ayad, Panagiotis Charalampopoulos, Solon P Pissis
BMC Bioinformatics|December 21, 2014
Linear-time computation of minimal absent words using suffix arrayCarl Barton, Alice Heliou, Laurent Mouchard, et al.
Pageof 3

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

Sort By:
Pageof 3
BMC Bioinformatics|July 10, 2014
MoTeX-II: structured MoTif eXtraction from large-scale datasetsSolon P Pissis
IEEE Journal of Biomedical and Health Informatics|November 19, 2021
Clustering Demographics and Sequences of Diagnosis CodesHaodi Zhong, Grigorios Loukides, Solon P Pissis
BMC Genomics|January 16, 2017
MARS: improving multiple circular sequence alignment using refined sequencesLorraine A K Ayad, Solon P Pissis
Algorithms for Molecular Biology : AMB|September 16, 2014
Optimal computation of all tandem repeats in a weighted sequenceCarl Barton, Costas S Iliopoulos, Solon P Pissis
Bioinformatics (Oxford, England)|April 14, 2017
emMAW: computing minimal absent words in external memoryAlice Héliou, Solon P Pissis, Simon J Puglisi
Algorithms for Molecular Biology : AMB|March 25, 2014
Fast algorithms for approximate circular string matchingCarl Barton, Costas S Iliopoulos, Solon P Pissis
Bioinformatics Advances|August 25, 2023
Seedability: optimizing alignment parameters for sensitive sequence comparisonLorraine A K Ayad, Rayan Chikhi, Solon P Pissis
Bioinformatics (Oxford, England)|November 14, 2018
CNEFinder: finding conserved non-coding elements in genomesLorraine A K Ayad, Solon P Pissis, Dimitris Polychronopoulos
Bioinformatics (Oxford, England)|December 25, 2019
SMART: SuperMaximal approximate repeats toolLorraine A K Ayad, Panagiotis Charalampopoulos, Solon P Pissis
BMC Bioinformatics|December 21, 2014
Linear-time computation of minimal absent words using suffix arrayCarl Barton, Alice Heliou, Laurent Mouchard, et al.
Pageof 3