Longest common substring in linear timeComputing the longest common substring of two strings using suffix arraysFind longest common substring using a rolling hashWhich algorithm to use to find all common substring (LCS case) with really big stringsFinding the longest repeating subsequenceHow to find longest recurring pattern from lage string data set?Longest substring with consecutive repetitionsDoes the Longest Common Subsequence problem reduce to its binary version?Substring problems in suffix treesNumber of optimal solutions for Longest Common Subsequence (Substring) problemLongest common sequence matrix giving wrong answer

Start making guitar arrangements

Are paving bricks differently sized for sand bedding vs mortar bedding?

What does chmod -u do?

Closed-form expression for certain product

What should you do if you miss a job interview (deliberately)?

What are the purposes of autoencoders?

How much character growth crosses the line into breaking the character

What was the exact wording from Ivanhoe of this advice on how to free yourself from slavery?

Multiplicative persistence

Longest common substring in linear time

Must Legal Documents Be Siged In Standard Pen Colors?

Fear of getting stuck on one programming language / technology that is not used in my country

copy and scale one figure (wheel)

Count the occurrence of each unique word in the file

Which one is correct as adjective “protruding” or “protruded”?

Travelling outside the UK without a passport

The screen of my macbook suddenly broken down how can I do to recover

Is it improper etiquette to ask your opponent what his/her rating is before the game?

Why should universal income be universal?

Why does the Sun have different day lengths, but not the gas giants?

Should I outline or discovery write my stories?

Is it better practice to read straight from sheet music rather than memorize it?

Lowest total scrabble score

Redundant comparison & "if" before assignment



Longest common substring in linear time


Computing the longest common substring of two strings using suffix arraysFind longest common substring using a rolling hashWhich algorithm to use to find all common substring (LCS case) with really big stringsFinding the longest repeating subsequenceHow to find longest recurring pattern from lage string data set?Longest substring with consecutive repetitionsDoes the Longest Common Subsequence problem reduce to its binary version?Substring problems in suffix treesNumber of optimal solutions for Longest Common Subsequence (Substring) problemLongest common sequence matrix giving wrong answer













2












$begingroup$


We know that the longest common substring of two strings can be found in O(N^2) time complexity.
Can a solution be found in only linear time?






algorithms time-complexity strings longest-common-substring







share|cite|improve this question











$endgroup$
















    2












    $begingroup$


    We know that the longest common substring of two strings can be found in O(N^2) time complexity.
    Can a solution be found in only linear time?






    algorithms time-complexity strings longest-common-substring







    share|cite|improve this question











    $endgroup$














      2












      2








      2





      $begingroup$


      We know that the longest common substring of two strings can be found in O(N^2) time complexity.
      Can a solution be found in only linear time?






      algorithms time-complexity strings longest-common-substring







      share|cite|improve this question











      $endgroup$




      We know that the longest common substring of two strings can be found in O(N^2) time complexity.
      Can a solution be found in only linear time?






      algorithms time-complexity strings longest-common-substring




      algorithms time-complexity strings longest-common-substring






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited 1 hour ago









      Discrete lizard♦

      4,44011537




      4,44011537










      asked 2 hours ago









      Manoharsinh RanaManoharsinh Rana

      917




      917




















          3 Answers
          3






          active

          oldest

          votes


















          2












          $begingroup$

          Yes, the longest common substring of two strings can be found in $O(m+n)$ time, where $m$ and $n$ are the lengths of the two strings, assuming the size of the alphabet is constant.



          Here is an excerpt from https://en.wikipedia.org/wiki/Longest_common_substring_problem.




          The longest common substrings of a set of strings can be found by building a generalized suffix tree for the strings, and then finding the deepest internal nodes which have leaf nodes from all the strings in the subtree below it.




          Building a generalized suffix tree for two given strings takes $Theta(m+n)$ time using the famous ingenious Ukkonen's algorithm. Finding the deepest internal nodes that come from both strings takes $Theta(m+n)$ time. Hence we can find the longest common substring in $Theta(m+n)$ time.






          share|cite|improve this answer









          $endgroup$












          • $begingroup$
            I did not see @D.W's answer, possibly because I was interrupted while writing my answer.
            $endgroup$
            – Apass.Jack
            27 mins ago



















          1












          $begingroup$

          It is unlikely that that a better algorithm than quadratic exists, let alone linear. For the related problem of finding subsequences, this is a known result: In the paper "Tight hardness results for LCS and other sequence similarity measures." by Abboud et al. , they show that the existence of an algorithm with a running time of $O(n^2-varepsilon)$, for some $varepsilon>0$ refutes the Strong Exponential Time Hypothesis (SETH).



          SETH is considered to be very likely true (although not universally accepted), so it is unlikely any $O(n^2-varepsilon)$ time algorithm exists.



          While finding a substring is a slightly different problem, it seems likely to be equally hard.






          share|cite|improve this answer











          $endgroup$












          • $begingroup$
            are you talking about subsequence? I am talking about substring.
            $endgroup$
            – Manoharsinh Rana
            1 hour ago











          • $begingroup$
            @ManoharsinhRana Ah, I see. The problems are similar, and it is hard to find results for the string variant. I think there are similar results for the substring problem, but they are not easy to find. You could try looking at papers that cite "Quadratic conditional lower bounds for string problems and dynamic time warping" by Bringmann and Künnemann, as their program lead to a lot of results related to this problem.
            $endgroup$
            – Discrete lizard♦
            1 hour ago










          • $begingroup$
            Longest common substring is much easier than longest common subsequence. See my answer.
            $endgroup$
            – D.W.♦
            30 mins ago


















          1












          $begingroup$

          Yes. There's even a Wikipedia article about it! https://en.wikipedia.org/wiki/Longest_common_substring_problem



          In particular, as Wikipedia explains, there is a linear-time algorithm, using suffix trees (or suffix arrays).



          Searching on "longest common substring" turns up that Wikipedia article as the first hit (for me). In the future, please research the problem before asking here. (See, e.g., https://meta.stackoverflow.com/q/261592/781723.)






          share|cite|improve this answer









          $endgroup$












            Your Answer





            StackExchange.ifUsing("editor", function ()
            return StackExchange.using("mathjaxEditing", function ()
            StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
            StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
            );
            );
            , "mathjax-editing");

            StackExchange.ready(function()
            var channelOptions =
            tags: "".split(" "),
            id: "419"
            ;
            initTagRenderer("".split(" "), "".split(" "), channelOptions);

            StackExchange.using("externalEditor", function()
            // Have to fire editor after snippets, if snippets enabled
            if (StackExchange.settings.snippets.snippetsEnabled)
            StackExchange.using("snippets", function()
            createEditor();
            );

            else
            createEditor();

            );

            function createEditor()
            StackExchange.prepareEditor(
            heartbeatType: 'answer',
            autoActivateHeartbeat: false,
            convertImagesToLinks: false,
            noModals: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: null,
            bindNavPrevention: true,
            postfix: "",
            imageUploader:
            brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
            contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
            allowUrls: true
            ,
            onDemand: true,
            discardSelector: ".discard-answer"
            ,immediatelyShowMarkdownHelp:true
            );



            );













            draft saved

            draft discarded


















            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f105969%2flongest-common-substring-in-linear-time%23new-answer', 'question_page');

            );

            Post as a guest















            Required, but never shown

























            3 Answers
            3






            active

            oldest

            votes








            3 Answers
            3






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            2












            $begingroup$

            Yes, the longest common substring of two strings can be found in $O(m+n)$ time, where $m$ and $n$ are the lengths of the two strings, assuming the size of the alphabet is constant.



            Here is an excerpt from https://en.wikipedia.org/wiki/Longest_common_substring_problem.




            The longest common substrings of a set of strings can be found by building a generalized suffix tree for the strings, and then finding the deepest internal nodes which have leaf nodes from all the strings in the subtree below it.




            Building a generalized suffix tree for two given strings takes $Theta(m+n)$ time using the famous ingenious Ukkonen's algorithm. Finding the deepest internal nodes that come from both strings takes $Theta(m+n)$ time. Hence we can find the longest common substring in $Theta(m+n)$ time.






            share|cite|improve this answer









            $endgroup$












            • $begingroup$
              I did not see @D.W's answer, possibly because I was interrupted while writing my answer.
              $endgroup$
              – Apass.Jack
              27 mins ago
















            2












            $begingroup$

            Yes, the longest common substring of two strings can be found in $O(m+n)$ time, where $m$ and $n$ are the lengths of the two strings, assuming the size of the alphabet is constant.



            Here is an excerpt from https://en.wikipedia.org/wiki/Longest_common_substring_problem.




            The longest common substrings of a set of strings can be found by building a generalized suffix tree for the strings, and then finding the deepest internal nodes which have leaf nodes from all the strings in the subtree below it.




            Building a generalized suffix tree for two given strings takes $Theta(m+n)$ time using the famous ingenious Ukkonen's algorithm. Finding the deepest internal nodes that come from both strings takes $Theta(m+n)$ time. Hence we can find the longest common substring in $Theta(m+n)$ time.






            share|cite|improve this answer









            $endgroup$












            • $begingroup$
              I did not see @D.W's answer, possibly because I was interrupted while writing my answer.
              $endgroup$
              – Apass.Jack
              27 mins ago














            2












            2








            2





            $begingroup$

            Yes, the longest common substring of two strings can be found in $O(m+n)$ time, where $m$ and $n$ are the lengths of the two strings, assuming the size of the alphabet is constant.



            Here is an excerpt from https://en.wikipedia.org/wiki/Longest_common_substring_problem.




            The longest common substrings of a set of strings can be found by building a generalized suffix tree for the strings, and then finding the deepest internal nodes which have leaf nodes from all the strings in the subtree below it.




            Building a generalized suffix tree for two given strings takes $Theta(m+n)$ time using the famous ingenious Ukkonen's algorithm. Finding the deepest internal nodes that come from both strings takes $Theta(m+n)$ time. Hence we can find the longest common substring in $Theta(m+n)$ time.






            share|cite|improve this answer









            $endgroup$



            Yes, the longest common substring of two strings can be found in $O(m+n)$ time, where $m$ and $n$ are the lengths of the two strings, assuming the size of the alphabet is constant.



            Here is an excerpt from https://en.wikipedia.org/wiki/Longest_common_substring_problem.




            The longest common substrings of a set of strings can be found by building a generalized suffix tree for the strings, and then finding the deepest internal nodes which have leaf nodes from all the strings in the subtree below it.




            Building a generalized suffix tree for two given strings takes $Theta(m+n)$ time using the famous ingenious Ukkonen's algorithm. Finding the deepest internal nodes that come from both strings takes $Theta(m+n)$ time. Hence we can find the longest common substring in $Theta(m+n)$ time.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered 31 mins ago









            Apass.JackApass.Jack

            13.3k1939




            13.3k1939











            • $begingroup$
              I did not see @D.W's answer, possibly because I was interrupted while writing my answer.
              $endgroup$
              – Apass.Jack
              27 mins ago

















            • $begingroup$
              I did not see @D.W's answer, possibly because I was interrupted while writing my answer.
              $endgroup$
              – Apass.Jack
              27 mins ago
















            $begingroup$
            I did not see @D.W's answer, possibly because I was interrupted while writing my answer.
            $endgroup$
            – Apass.Jack
            27 mins ago





            $begingroup$
            I did not see @D.W's answer, possibly because I was interrupted while writing my answer.
            $endgroup$
            – Apass.Jack
            27 mins ago












            1












            $begingroup$

            It is unlikely that that a better algorithm than quadratic exists, let alone linear. For the related problem of finding subsequences, this is a known result: In the paper "Tight hardness results for LCS and other sequence similarity measures." by Abboud et al. , they show that the existence of an algorithm with a running time of $O(n^2-varepsilon)$, for some $varepsilon>0$ refutes the Strong Exponential Time Hypothesis (SETH).



            SETH is considered to be very likely true (although not universally accepted), so it is unlikely any $O(n^2-varepsilon)$ time algorithm exists.



            While finding a substring is a slightly different problem, it seems likely to be equally hard.






            share|cite|improve this answer











            $endgroup$












            • $begingroup$
              are you talking about subsequence? I am talking about substring.
              $endgroup$
              – Manoharsinh Rana
              1 hour ago











            • $begingroup$
              @ManoharsinhRana Ah, I see. The problems are similar, and it is hard to find results for the string variant. I think there are similar results for the substring problem, but they are not easy to find. You could try looking at papers that cite "Quadratic conditional lower bounds for string problems and dynamic time warping" by Bringmann and Künnemann, as their program lead to a lot of results related to this problem.
              $endgroup$
              – Discrete lizard♦
              1 hour ago










            • $begingroup$
              Longest common substring is much easier than longest common subsequence. See my answer.
              $endgroup$
              – D.W.♦
              30 mins ago















            1












            $begingroup$

            It is unlikely that that a better algorithm than quadratic exists, let alone linear. For the related problem of finding subsequences, this is a known result: In the paper "Tight hardness results for LCS and other sequence similarity measures." by Abboud et al. , they show that the existence of an algorithm with a running time of $O(n^2-varepsilon)$, for some $varepsilon>0$ refutes the Strong Exponential Time Hypothesis (SETH).



            SETH is considered to be very likely true (although not universally accepted), so it is unlikely any $O(n^2-varepsilon)$ time algorithm exists.



            While finding a substring is a slightly different problem, it seems likely to be equally hard.






            share|cite|improve this answer











            $endgroup$












            • $begingroup$
              are you talking about subsequence? I am talking about substring.
              $endgroup$
              – Manoharsinh Rana
              1 hour ago











            • $begingroup$
              @ManoharsinhRana Ah, I see. The problems are similar, and it is hard to find results for the string variant. I think there are similar results for the substring problem, but they are not easy to find. You could try looking at papers that cite "Quadratic conditional lower bounds for string problems and dynamic time warping" by Bringmann and Künnemann, as their program lead to a lot of results related to this problem.
              $endgroup$
              – Discrete lizard♦
              1 hour ago










            • $begingroup$
              Longest common substring is much easier than longest common subsequence. See my answer.
              $endgroup$
              – D.W.♦
              30 mins ago













            1












            1








            1





            $begingroup$

            It is unlikely that that a better algorithm than quadratic exists, let alone linear. For the related problem of finding subsequences, this is a known result: In the paper "Tight hardness results for LCS and other sequence similarity measures." by Abboud et al. , they show that the existence of an algorithm with a running time of $O(n^2-varepsilon)$, for some $varepsilon>0$ refutes the Strong Exponential Time Hypothesis (SETH).



            SETH is considered to be very likely true (although not universally accepted), so it is unlikely any $O(n^2-varepsilon)$ time algorithm exists.



            While finding a substring is a slightly different problem, it seems likely to be equally hard.






            share|cite|improve this answer











            $endgroup$



            It is unlikely that that a better algorithm than quadratic exists, let alone linear. For the related problem of finding subsequences, this is a known result: In the paper "Tight hardness results for LCS and other sequence similarity measures." by Abboud et al. , they show that the existence of an algorithm with a running time of $O(n^2-varepsilon)$, for some $varepsilon>0$ refutes the Strong Exponential Time Hypothesis (SETH).



            SETH is considered to be very likely true (although not universally accepted), so it is unlikely any $O(n^2-varepsilon)$ time algorithm exists.



            While finding a substring is a slightly different problem, it seems likely to be equally hard.







            share|cite|improve this answer














            share|cite|improve this answer



            share|cite|improve this answer








            edited 1 hour ago

























            answered 1 hour ago









            Discrete lizard♦Discrete lizard

            4,44011537




            4,44011537











            • $begingroup$
              are you talking about subsequence? I am talking about substring.
              $endgroup$
              – Manoharsinh Rana
              1 hour ago











            • $begingroup$
              @ManoharsinhRana Ah, I see. The problems are similar, and it is hard to find results for the string variant. I think there are similar results for the substring problem, but they are not easy to find. You could try looking at papers that cite "Quadratic conditional lower bounds for string problems and dynamic time warping" by Bringmann and Künnemann, as their program lead to a lot of results related to this problem.
              $endgroup$
              – Discrete lizard♦
              1 hour ago










            • $begingroup$
              Longest common substring is much easier than longest common subsequence. See my answer.
              $endgroup$
              – D.W.♦
              30 mins ago
















            • $begingroup$
              are you talking about subsequence? I am talking about substring.
              $endgroup$
              – Manoharsinh Rana
              1 hour ago











            • $begingroup$
              @ManoharsinhRana Ah, I see. The problems are similar, and it is hard to find results for the string variant. I think there are similar results for the substring problem, but they are not easy to find. You could try looking at papers that cite "Quadratic conditional lower bounds for string problems and dynamic time warping" by Bringmann and Künnemann, as their program lead to a lot of results related to this problem.
              $endgroup$
              – Discrete lizard♦
              1 hour ago










            • $begingroup$
              Longest common substring is much easier than longest common subsequence. See my answer.
              $endgroup$
              – D.W.♦
              30 mins ago















            $begingroup$
            are you talking about subsequence? I am talking about substring.
            $endgroup$
            – Manoharsinh Rana
            1 hour ago





            $begingroup$
            are you talking about subsequence? I am talking about substring.
            $endgroup$
            – Manoharsinh Rana
            1 hour ago













            $begingroup$
            @ManoharsinhRana Ah, I see. The problems are similar, and it is hard to find results for the string variant. I think there are similar results for the substring problem, but they are not easy to find. You could try looking at papers that cite "Quadratic conditional lower bounds for string problems and dynamic time warping" by Bringmann and Künnemann, as their program lead to a lot of results related to this problem.
            $endgroup$
            – Discrete lizard♦
            1 hour ago




            $begingroup$
            @ManoharsinhRana Ah, I see. The problems are similar, and it is hard to find results for the string variant. I think there are similar results for the substring problem, but they are not easy to find. You could try looking at papers that cite "Quadratic conditional lower bounds for string problems and dynamic time warping" by Bringmann and Künnemann, as their program lead to a lot of results related to this problem.
            $endgroup$
            – Discrete lizard♦
            1 hour ago












            $begingroup$
            Longest common substring is much easier than longest common subsequence. See my answer.
            $endgroup$
            – D.W.♦
            30 mins ago




            $begingroup$
            Longest common substring is much easier than longest common subsequence. See my answer.
            $endgroup$
            – D.W.♦
            30 mins ago











            1












            $begingroup$

            Yes. There's even a Wikipedia article about it! https://en.wikipedia.org/wiki/Longest_common_substring_problem



            In particular, as Wikipedia explains, there is a linear-time algorithm, using suffix trees (or suffix arrays).



            Searching on "longest common substring" turns up that Wikipedia article as the first hit (for me). In the future, please research the problem before asking here. (See, e.g., https://meta.stackoverflow.com/q/261592/781723.)






            share|cite|improve this answer









            $endgroup$

















              1












              $begingroup$

              Yes. There's even a Wikipedia article about it! https://en.wikipedia.org/wiki/Longest_common_substring_problem



              In particular, as Wikipedia explains, there is a linear-time algorithm, using suffix trees (or suffix arrays).



              Searching on "longest common substring" turns up that Wikipedia article as the first hit (for me). In the future, please research the problem before asking here. (See, e.g., https://meta.stackoverflow.com/q/261592/781723.)






              share|cite|improve this answer









              $endgroup$















                1












                1








                1





                $begingroup$

                Yes. There's even a Wikipedia article about it! https://en.wikipedia.org/wiki/Longest_common_substring_problem



                In particular, as Wikipedia explains, there is a linear-time algorithm, using suffix trees (or suffix arrays).



                Searching on "longest common substring" turns up that Wikipedia article as the first hit (for me). In the future, please research the problem before asking here. (See, e.g., https://meta.stackoverflow.com/q/261592/781723.)






                share|cite|improve this answer









                $endgroup$



                Yes. There's even a Wikipedia article about it! https://en.wikipedia.org/wiki/Longest_common_substring_problem



                In particular, as Wikipedia explains, there is a linear-time algorithm, using suffix trees (or suffix arrays).



                Searching on "longest common substring" turns up that Wikipedia article as the first hit (for me). In the future, please research the problem before asking here. (See, e.g., https://meta.stackoverflow.com/q/261592/781723.)







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered 49 mins ago









                D.W.♦D.W.

                102k12127291




                102k12127291



























                    draft saved

                    draft discarded
















































                    Thanks for contributing an answer to Computer Science Stack Exchange!


                    • Please be sure to answer the question. Provide details and share your research!

                    But avoid …


                    • Asking for help, clarification, or responding to other answers.

                    • Making statements based on opinion; back them up with references or personal experience.

                    Use MathJax to format equations. MathJax reference.


                    To learn more, see our tips on writing great answers.




                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function ()
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f105969%2flongest-common-substring-in-linear-time%23new-answer', 'question_page');

                    );

                    Post as a guest















                    Required, but never shown





















































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown

































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown







                    -

                    Popular posts from this blog

                    Are there any AGPL-style licences that require source code modifications to be public? Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?Force derivative works to be publicAre there any GPL like licenses for Apple App Store?Do you violate the GPL if you provide source code that cannot be compiled?GPL - is it distribution to use libraries in an appliance loaned to customers?Distributing App for free which uses GPL'ed codeModifications of server software under GPL, with web/CLI interfaceDoes using an AGPLv3-licensed library prevent me from dual-licensing my own source code?Can I publish only select code under GPLv3 from a private project?Is there published precedent regarding the scope of covered work that uses AGPL software?If MIT licensed code links to GPL licensed code what should be the license of the resulting binary program?If I use a public API endpoint that has its source code licensed under AGPL in my app, do I need to disclose my source?

                    Image
                    Flight departed from the gate 5 min before scheduled departure time. Refund options How to show a density matrix is in a pure/mixed state? Can we cancel the equality mark here? How to ask rejected full-time candidates to apply to teach individual courses? Are there any AGPL-style licences that require source code modifications to be public? Why did Israel vote against lifting the American embargo on Cuba? What should one know about term logic before studying propositional and predicate logic? Why is Rajasthan pro BJP in the LS elections but not in the state elections? New Order #6: Easter Egg Question on Gÿongy' lemma proof How to resize main filesystem Is it OK if I do not take the receipt in Germany? My mentor says to set image to Fine instead of RAW — how is this different from JPG? Can I feed enough spin up electron to a black hole to affect it's angular momentum? How do I find my Spellcasting Ability for my D&D character? Is my guitar...
                    Read more

                    2013 GY136 Descoberta | Órbita | Referências Menu de navegação«List Of Centaurs and Scattered-Disk Objects»«List of Known Trans-Neptunian Objects»

                    Image
                    Objetos do disco dispersoObjetos transnetunianos objeto transnetunianodisco dispersoSistema Solarcorpo celesteressonância orbitalplanetaplanetamagnitude absolutadiâmetro9 de abril2013Outer Solar System Origins Surveyórbitaexcentricidadesemieixo maiorUAperiélioSolafélio 2013 GY136 Data da descoberta 9 de abril de 2013 Descoberto por Outer Solar System Origins Survey Categoria Transnetuniano Objeto do disco disperso Elementos orbitais Semieixo maior 55,961 UA Perélio 32,595 UA Afélio 79,327 UA Excentricidade 0,418 Inclinação 10,9° Características físicas Dimensões 133 km Magnitude absoluta 7,6 ver 2013 GY 136 , também escrito como 2013 GY136 , é um objeto transnetuniano que está localizado no disco disperso, uma região do Sistema Solar. Este corpo celeste está em uma ressonância orbital de 2:5 com o planeta planeta. Ele possui uma magnitude absoluta de 7,6 [ 1 ] e tem um diâmetro estimad...
                    Read more

                    Metrô de Los Teques Índice Linhas | Estações | Ver também | Referências Ligações externas | Menu de navegação«INSTITUCIÓN»«Mapa de rutas»originalMetrô de Los TequesC.A. Metro Los Teques |Alcaldía de Guaicaipuro – Sitio OficialGobernacion de Mirandaeeeeeee

                    Image
                    Metrô de Los TequesFundações na Venezuela em 2006 metropolitanoLos TequesGuaicaipuroMirandaGoverno da VenezuelaLinha 1Linha 2estaçõesLinha 1Linha 2IndependenciaSan AntonioLinha 3GuaicaipuroLibertadorEstação Las AdjuntasMetrô de Caracasalgarismocorestaçõesnomecorestaçõesestações Metrô de Los Teques Uma das composições que operam no sistema. Informações Proprietário Governo da Venezuela Local [[ Los Teques, Miranda]] País variant = Tipo de transporte Metropolitano Número de linhas 2 Número de estações 5 Website [1] Funcionamento Início de funcionamento 3 de novembro de 2006 (12 anos) [ 1 ] Operadora(s) C. A. Metro Los Teques Dados técnicos Extensão do sistema 11,2 km Bitola Bitola padrão (1435 mm) Velocidade máxima 80 km/h ...
                    Read more