Pairwise versus multiple network alignment

نویسندگان

  • Vipin Vijayan
  • Eric Krebs
  • Lei Meng
  • Tijana Milenkovic
چکیده

Motivation: Network alignment (NA) can be pairwise (PNA) and multiple (MNA). PNA produces aligned node pairs between two networks. MNA produces aligned node clusters between more than two networks. Recently, the focus has shi‰ed from PNA to MNA, because MNA captures conserved regions between more networks than PNA (and MNA is thus considered to be more insightful), though at higher computational complexity. Œe issue is that, due to the different outputs of PNA and MNA, a PNA method is only compared to other PNA methods, and an MNAmethod is only compared to other MNA methods. Comparison of PNA against MNA must be done to evaluate whether MNA’s higher complexity is justified by its higher accuracy. Results: We introduce a framework that allows for this. We compare PNA against MNA in both a pairwise (native to PNA) and multiple (native to MNA) manner. Shockingly, we find that PNA is more accurate and faster than MNA in both cases. Œis result might guide future research efforts in the NA field. Contact: [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

gpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences

Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...

متن کامل

Multiple sequence alignment by combining incomplete blocks of similar segments

We have developed a novel method for multiple sequence alignment based on combinatorial selection of similar block candidates. Our method resembles manual multiple alignment performed by biologists. The method is more feasible for nding functional motifs than previous multiple alignment algorithms that are extensions of pairwise alignments. We employed a Hop eld neural network technique so that...

متن کامل

Universit at Bielefeld Forschungsschwerpunkt Mathematisierung | Strukturbildungsprozesse on Simultaneous versus Iterative Multiple Sequence Alignment on Simultaneous versus Iterative Multiple Sequence Alignment

One of the main problems in computational biology is the construction of biologically plausible alignments for given sequence families. Many procedures have been developed for this purpose; most are based on clustering the sequences hierarchically prior to the computation of their alignment and then proceeding recursively. In this paper, we compare results obtained with a new algorithm for simu...

متن کامل

IsoRankN: spectral methods for global alignment of multiple protein networks

MOTIVATION With the increasing availability of large protein-protein interaction networks, the question of protein network alignment is becoming central to systems biology. Network alignment is further delineated into two sub-problems: local alignment, to find small conserved motifs across networks, and global alignment, which attempts to find a best mapping between all nodes of the two network...

متن کامل

Multiple Sequence Alignment Using Three- Dimensional Fragments

Background: Dialign is a DNA/Protein alignment tool for performing pairwise and multiple pairwise alignments through the comparison of gap-free segments (fragments) between sequence pairs. An alignment of two sequences is a chain of fragments, i.e local gap-free pairwise alignments, with the highest total score. METHOD: A new approach is defined in this article which relies on the concept of us...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017