Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Aris Floratos

dblp:18/5854 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
0since 2021 · last 2012
0000-0002-9290-7931ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 6 · 3 first-authorArtificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
5 papers
Bioinformatics and computational biology · 100%
Theoretical computer science
3 papers
Algorithms and data structures · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 12 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › biological network › network biology › network inference
gene regulatory network inference
0.112010
geWorkbench: an open source platform for integrative genomics · Bioinform. 2010
Bioinformatics and computational biology › genomics › computational genomics
integrative genomics
0.112010
geWorkbench: an open source platform for integrative genomics · Bioinform. 2010
Bioinformatics and computational biology
sequence analysis
0.141999
Sequence homology detection through large scale pattern discovery · RECOMB 1999
Combinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm [published erratum appears in Bioinformatics 1998;14(2): 229] · Bioinform. 1998
Motif discovery without alignment or enumeration (extended abstract) · RECOMB 1998
Bioinformatics and computational biology › sequence analysis
motif discovery
0.131999
Building Dictionaries of 1D and 3D Motifs by Mining the Unaligned 1D Sequences of 17 Archaeal and Bacterial Genomes · ISMB 1999
Combinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm [published erratum appears in Bioinformatics 1998;14(2): 229] · Bioinform. 1998
Motif discovery without alignment or enumeration (extended abstract) · RECOMB 1998
Algorithms and data structures › sequence algorithms
string algorithms
0.022000
Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm · SODA 2000
Motif discovery without alignment or enumeration (extended abstract) · RECOMB 1998
Data mining › structured data mining › graph mining
motif discovery
0.012000
Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm · SODA 2000
Data mining
pattern mining
0.012000
Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm · SODA 2000
Bioinformatics and computational biology
genomics
0.011999
Building Dictionaries of 1D and 3D Motifs by Mining the Unaligned 1D Sequences of 17 Archaeal and Bacterial Genomes · ISMB 1999
Bioinformatics and computational biology › sequence analysis › motif discovery
pattern discovery
0.011999
Sequence homology detection through large scale pattern discovery · RECOMB 1999
Bioinformatics and computational biology › sequence analysis
sequence similarity search
0.011999
Sequence homology detection through large scale pattern discovery · RECOMB 1999
Algorithms and data structures › sequence algorithms › string algorithms
motif discovery
0.011998
Motif discovery without alignment or enumeration (extended abstract) · RECOMB 1998
Bioinformatics and computational biology › sequence analysis
unaligned sequence analysis
0.011999
Building Dictionaries of 1D and 3D Motifs by Mining the Unaligned 1D Sequences of 17 Archaeal and Bacterial Genomes · ISMB 1999

Methods — techniques the papers use, named apart from their topics

homology detection · 0.1clustering · 0.1classification · 0.1polynomial-time algorithm · 0.1combinatorial pattern discovery · 0.0alignment-free motif discovery · 0.0sequence mining · 0.0pattern discovery · 0.0output-sensitive algorithms · 0.0output-sensitive algorithm · 0.0
YearPublicationVenuePosition
2012 Using systems and structure biology tools to dissect cellular phenotypes
abstract
The Center for the Multiscale Analysis of Genetic Networks (MAGNet, http://magnet.c2b2.columbia.edu) was established in 2005, with the mission of providing the biomedical research community with Structural and Systems Biology algorithms and software tools for the dissection of molecular interactions and for the interaction-based elucidation of cellular phenotypes. Over the last 7 years, MAGNet investigators have developed many novel analysis methodologies, which have led to important biological discoveries, including understanding the role of the DNA shape in protein-DNA binding specificity and the discovery of genes causally related to the presentation of malignant phenotypes, including lymphoma, glioma, and melanoma. Software tools implementing these methodologies have been broadly adopted by the research community and are made freely available through geWorkbench, the Center's integrated analysis platform. Additionally, MAGNet has been instrumental in organizing and developing key conferences and meetings focused on the emerging field of systems biology and regulatory genomics, with special focus on cancer-related research.
Aris Floratos, Barry Honig, Dana Pe'er, Andrea Califano
J. Am. Medical Informatics Assoc.1
2010 geWorkbench: an open source platform for integrative genomics
abstract
SUMMARY: geWorkbench (genomics Workbench) is an open source Java desktop application that provides access to an integrated suite of tools for the analysis and visualization of data from a wide range of genomics domains (gene expression, sequence, protein structure and systems biology). More than 70 distinct plug-in modules are currently available implementing both classical analyses (several variants of clustering, classification, homology detection, etc.) as well as state of the art algorithms for the reverse engineering of regulatory networks and for protein structure prediction, among many others. geWorkbench leverages standards-based middleware technologies to provide seamless access to remote data, annotation and computational servers, thus, enabling researchers with limited local resources to benefit from available public infrastructure. AVAILABILITY: The project site (http://www.geworkbench.org) includes links to self-extracting installers for most operating system (OS) platforms as well as instructions for building the application from scratch using the source code [which is freely available from the project's SVN (subversion) repository]. geWorkbench support is available through the end-user and developer forums of the caBIG Molecular Analysis Tools Knowledge Center, https://cabig-kc.nci.nih.gov/Molecular/forums/
Aris Floratos, Kenneth Smith 0001, Zhou Ji, John Watkinson, Andrea Califano
Bioinform.1
2000 Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm
Laxmi Parida, Isidore Rigoutsos, Aris Floratos, Daniel E. Platt
SODA3
1999 Building Dictionaries of 1D and 3D Motifs by Mining the Unaligned 1D Sequences of 17 Archaeal and Bacterial Genomes
Isidore Rigoutsos, Aris Floratos, Laxmi Parida
ISMB3
1999 Sequence homology detection through large scale pattern discovery
abstract
Article Sequence homology detection through large scale pattern discovery Share on Authors: Aris Floratos Computational Biology Center, IBM Research Division, T. J. Watson Research Center, P. O. Box 218, Yorktown Heights, NY and Courant Institute of Mathematical Sciences, New York University, New York, NY Computational Biology Center, IBM Research Division, T. J. Watson Research Center, P. O. Box 218, Yorktown Heights, NY and Courant Institute of Mathematical Sciences, New York University, New York, NYView Profile , Isidore Rigoutsos Computational Biology Center, IBM Research Division, T. J. Watson Research Center, P. O. Box 218, Yorktown Heights, NY Computational Biology Center, IBM Research Division, T. J. Watson Research Center, P. O. Box 218, Yorktown Heights, NYView Profile , Laxmi Parida Computational Biology Center, IBM Research Division, T. J. Watson Research Center, P. O. Box 218, Yorktown Heights, NY and Courant Institute of Mathematical Sciences, New York University, New York, NY Computational Biology Center, IBM Research Division, T. J. Watson Research Center, P. O. Box 218, Yorktown Heights, NY and Courant Institute of Mathematical Sciences, New York University, New York, NYView Profile , Gustova Stolovitzky Computational Biology Center, IBM Research Division, T. J. Watson Research Center, P. O. Box 218, Yorktown Heights, NY Computational Biology Center, IBM Research Division, T. J. Watson Research Center, P. O. Box 218, Yorktown Heights, NYView Profile , Yuan Gao Computational Biology Center, IBM Research Division, T. J. Watson Research Center, P. O. Box 218, Yorktown Heights, NY Computational Biology Center, IBM Research Division, T. J. Watson Research Center, P. O. Box 218, Yorktown Heights, NYView Profile Authors Info & Claims RECOMB '99: Proceedings of the third annual international conference on Computational molecular biologyApril 1999 Pages 164–173https://doi.org/10.1145/299432.299477Online:01 April 1999Publication History 6citation379DownloadsMetricsTotal Citations6Total Downloads379Last 12 Months2Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Aris Floratos, Isidore Rigoutsos, Laxmi Parida, Gustavo Stolovitzky
RECOMB1
1998 Motif discovery without alignment or enumeration (extended abstract)
Isidore Rigoutsos, Aris Floratos
RECOMB2
1998 Combinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm [published erratum appears in Bioinformatics 1998;14(2): 229]
abstract
MOTIVATION: The discovery of motifs in biological sequences is an important problem. RESULTS: This paper presents a new algorithm for the discovery of rigid patterns (motifs) in biological sequences. Our method is combinatorial in nature and able to produce all patterns that appear in at least a (user-defined) minimum number of sequences, yet it manages to be very efficient by avoiding the enumeration of the entire pattern space. Furthermore, the reported patterns are maximal: any reported pattern cannot be made more specific and still keep on appearing at the exact same positions within the input sequences. The effectiveness of the proposed approach is showcased on a number of test cases which aim to: (i) validate the approach through the discovery of previously reported patterns; (ii) demonstrate the capability to identify automatically highly selective patterns particular to the sequences under consideration. Finally, experimental analysis indicates that the algorithm is output sensitive, i.e. its running time is quasi-linear to the size of the generated output.
Isidore Rigoutsos, Aris Floratos
Bioinform.2
1994 BIND: A Biomedical INteroperable Database System
Catherine E. Houstis, Theodore S. Papatheodorou, Vassilios S. Verykios, Aris Floratos, Ahmed K. Elmagarmid
DEXA4