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

Firas Swidan

dblp:18/5897 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 2008
—ORCID · none

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

Theory of computation · 3Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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.

Theoretical computer science
1 paper
Algorithms and data structures · 87% Combinatorics and discrete mathematics · 13%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › sequence algorithms
sorting
0.012004
Improved bounds on sorting with length-weighted reversals · SODA 2004
Algorithms and data structures › computational biology › genome rearrangement
sorting by reversals
0.012004
Improved bounds on sorting with length-weighted reversals · SODA 2004
Combinatorics and discrete mathematics › permutation
permutation sorting
0.012004
Improved bounds on sorting with length-weighted reversals · SODA 2004

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

approximation bounds · 0.0
YearPublicationVenuePosition
2008 Improved bounds on sorting by length-weighted reversals
Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter, Steven Skiena, Firas Swidan
J. Comput. Syst. Sci.7
2006 On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem
Firas Swidan, Michal Ziv-Ukelson, Ron Y. Pinter
CPM1
2006 An Integrative Method for Accurate Comparative Genome Mapping
abstract
We present MAGIC, an integrative and accurate method for comparative genome mapping. Our method consists of two phases: preprocessing for identifying "maximal similar segments," and mapping for clustering and classifying these segments. MAGIC's main novelty lies in its biologically intuitive clustering approach, which aims towards both calculating reorder-free segments and identifying orthologous segments. In the process, MAGIC efficiently handles ambiguities resulting from duplications that occurred before the speciation of the considered organisms from their most recent common ancestor. We demonstrate both MAGIC's robustness and scalability: the former is asserted with respect to its initial input and with respect to its parameters' values. The latter is asserted by applying MAGIC to distantly related organisms and to large genomes. We compare MAGIC to other comparative mapping methods and provide detailed analysis of the differences between them. Our improvements allow a comprehensive study of the diversity of genetic repertoires resulting from large-scale mutations, such as indels and duplications, including explicitly transposable and phagic elements. The strength of our method is demonstrated by detailed statistics computed for each type of these large-scale mutations. MAGIC enabled us to conduct a comprehensive analysis of the different forces shaping prokaryotic genomes from different clades, and to quantify the importance of novel gene content introduced by horizontal gene transfer relative to gene duplication in bacterial genome evolution. We use these results to investigate the breakpoint distribution in several prokaryotic genomes.
Firas Swidan, Eduardo P. C. Rocha, Michael Shmoish, Ron Y. Pinter
PLoS Comput. Biol.1
2004 Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity
Firas Swidan, Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter
CPM1
2004 Improved bounds on sorting with length-weighted reversals
Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter, Steven Skiena, Firas Swidan
SODA7
2002 On the Complexity of Protein Similarity Search under mRNA Structure Constraints
Rolf Backofen, N. S. Narayanaswamy, Firas Swidan
STACS3