On aggregation of metric structures: the extended quasi-metric case

References

• Borsík , J. and Doboš , J. 1981 . On a product of metric spaces . Math. Slovaca , 31 : 193 – 205 .
   Google Scholar
• A. Pradera , E. Trillas , E. Castiñeira , On distances aggregation , in: Proc. of the Information Processing and Management of Uncertainty in Knowledge-based Systems international Conference 2000 , 693 – 700 .
   Google Scholar
• Pradera , A. , Trillas , E. and Castiñeira , E. 2002 . “ On the aggregation of some classes of fuzzy relations ” . In Technologies for constructing intelligent systems , Edited by: Bouchon-Meunier , B. , Gutierrez , J. , Magdalena , L. and Yager , R. 125 – 147 . Springer-Verlag .
   Google Scholar
• Pradera , A. and Trillas , E. 2002 . A note on pseudometrics aggregation . Int. J. Gen. Syst. , 31 : 41 – 51 .
   Web of Science ®Google Scholar
• Casasnovas , J. and Roselló , F. 2005 . Averaging fuzzy biopolymers . Fuzzy Set. Syst. , 152 : 139 – 158 .
   Web of Science ®Google Scholar
• J. Casasnovas , F. Roselló , Midpoints as average representations of pairs of descriptions by means of fuzzy subsets , in: Proc. of the Information Processing and Management of Uncertainty in Knowledge-based Systems International Conference 2005 , 2157 – 2164 .
   Google Scholar
• Schellekens , M. 1995 . The Smyth completion: A common foundation for denonational semantics and complexity analysis . Electron. Notes Theor. Comput. Sci. , 1 : 211 – 232 .
   Google Scholar
• García-Raffi , L.M. , Romaguera , S. and Sánchez-Pérez , E.A. 2003 . The supremum asymmetric norm on sequence algebras: A general framework to measure complexity spaces . Electron. Notes Theor. Comput. Sci. , 74 : 39 – 50 .
   Google Scholar
• García-Raffi , L.M. , Romaguera , S. and Sánchez-Pérez , E.A. 2002 . Sequence spaces and asymmetric norms in the theory of computational complexity . Math. Comput. Model. , 36 : 1 – 11 .
   Web of Science ®Google Scholar
• Romaguera , S. , Sánchez-Pérez , E. A. and Valero , O. 2003 . Computing complexity distances between algorithms . Kybernetika , 39 : 569 – 582 .
   Web of Science ®Google Scholar
• L.M. García-Raffi , S. Romaguera , E.A. Sánchez-Pérez , O. Valero , Normed semialgebras: a mathematical model for the complexity analysis of programs and algorithms , in: Proc. of the Seventh World Multi-conference on Systemics, Cybernetics and Informatics 2003 , vol. II , 55 – 58 .
   Google Scholar
• Seda , A. K. 1997 . Quasi-metrics and the semantics of logic programs . Fund. Inform. , 29 : 97 – 117 .
   Google Scholar
• Seda , A. K. 1999 . Some Issues Concerning Fixed Points in Computational Logic: Quasi-Metrics, Multivalued Mappings and the Knaster-Tarski Theorem . Topology Proc. , 24 : 223 – 250 .
   Google Scholar
• Stojmirović , A. 2004 . Quasi-metric spaces with measure . Topology Proc. , 28 : 655 – 671 .
   Google Scholar
• A. Stojmirović , Quasi-metrics, similarities and searches: aspects of geometry of protein datasets , Ph.D. Thesis , Victoria University of Wellington , Wellington , 2005 .
   Google Scholar
• Pestov , V. and Stojmirović , A. 2007 . Indexing schemes for similarity search in datasets of short protein fragments . Inform. Syst. , 35 : 1145 – 1165 .
   Google Scholar
• Stojmirović , A. and Yu , Y.-K. 2009 . Geometric aspects of biological sequence comparison . J. Comput Biol. , 16 : 579 – 610 .
   PubMed Web of Science ®Google Scholar
• G. Mayor , O. Valero , Aggregating asymmetric distances in Computer Sciences , in Proc. of the 8th International FLINS Conference on Computational Intelligence in Decision and Control 2008 , 477 – 482 .
   Google Scholar
• Mayor , G. and Valero , O. 2010 . Aggregation of asymmetric distances in Computer Science . Inform. Sci. , 180 : 803 – 812 .
   Web of Science ®Google Scholar
• Künzi , H.P.A. 2001 . “ Nonsymmetric distances and their associated topologies: About the origins of basic ideas in the area of asymmetric topology ” . In Handbook of the History of General Topology , Edited by: Aull , C.E. and Lowen , R. Vol. 3 , 853 – 968 . Kluwer Acad. Publ .
   Google Scholar
• Casasnovas , J. and Valero , O. 2008 . A connection between Computer Science and Fuzzy Theory: Midpoints and running time of computing . Mathware & Soft Computing , 15 : 251 – 261 .
   Google Scholar
• Tirado , P. and Valero , O. 2009 . The average running time of an algorithm as a midpoint between fuzzy sets . Math. Comput. Model. , 49 : 1852 – 1868 .
   Web of Science ®Google Scholar
• S. Massanet , O. Valero , New results on metric aggregation , in: Proc. of the 17th Spanish Conference on Fuzzy Technology and Fuzzy Logic-Estylf 2012 , 558 – 563 .
   Google Scholar
• Martin , J. , Mayor , G. and Valero , O. 2011 . On aggregation of normed structures . Math. Comput. Model. , 54 : 815 – 827 .
   Google Scholar
• J. Martin , G. Mayor , O. Valero , A fixed point theorem for asymmetric distances via aggregation functions , in: Proc. of the 6th International Summer School on Aggregation Operators 2011 , 217 – 222 .
   Google Scholar
• Romaguera , S. and Valero , O. 2008 . On the structure of the space of complexity partial functions . Int. J. Comput. Math. , 85 : 631 – 640 .
   Web of Science ®Google Scholar
• Romaguera , S. , Schellekens , M. P. and Valero , O. 2011 . The complexity space of partial functions: A connection between complexity analysis and denotational semantics . Int. J. Comput. Math. , 88 : 1819 – 1829 .
   Web of Science ®Google Scholar